Cover Image

Degree conditions for disjoint path covers in digraphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ma, Ansong, Sun, Yuefang
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Internally-disjoint directed pendant Steiner trees with three terminal vertices in Cartesian product digraphs
by: Yu, Shanshan, et al.
Published: (2026)

Internally-disjoint Pendant Steiner Trees in Digraphs
by: Yu, Shanshan, et al.
Published: (2025)

Arc-disjoint Steiner Cycles in Digraphs
by: Bai, Jie, et al.
Published: (2026)

Arc-disjoint in- and out-branchings in semicomplete split digraphs
by: Ai, Jiangdong, et al.
Published: (2024)

Steiner Type Packing Problems in Digraphs: A Survey
by: Sun, Yuefang
Published: (2022)

Edge disjoint Hamilton cycles in random digraphs of constant minimum degree
by: Cooper, Colin, et al.
Published: (2026)

Degree conditions for Ramsey goodness of paths
by: Aragão, Lucas, et al.
Published: (2024)

Extremal results on Berge disjoint paths
by: Zhao, Xiamiao, et al.
Published: (2025)

On the length of directed paths in digraphs
by: Cheng, Yangyang, et al.
Published: (2024)

Oriented trees and paths in digraphs
by: Stein, Maya
Published: (2023)

$\partial$-invariant path generators for digraphs
by: Li, Zhenzhi, et al.
Published: (2026)

Kings and Kernels in Semicomplete Compositions
by: Sun, Yuefang, et al.
Published: (2020)

On the supersaturation of oriented Turán problems
by: Hu, Xuanrui, et al.
Published: (2026)

Paired many-to-many 2-disjoint path cover of Johnson graphs
by: Liu, Jinhao, et al.
Published: (2025)

Packing internally disjoint Steiner paths of data center networks
by: Zhu, Wen-Han, et al.
Published: (2024)

Two-disjoint-cycle-cover vertex pancyclicity of split-star networks
by: Liu, Chang, et al.
Published: (2026)

Sufficient conditions for closed-trailable in digraphs
by: Dong, Changchang, et al.
Published: (2024)

On odd covers of cliques and disjoint unions
by: Buchanan, Calum, et al.
Published: (2024)

Orthogonality between acyclic subdigraphs and paths in digraphs
by: Silva, Caroline A. de Paula, et al.
Published: (2026)

Exact Turán numbers of two vertex-disjoint paths
by: Dong, Miao, et al.
Published: (2025)

On oriented Turán problems
by: Gerbner, Dániel, et al.
Published: (2026)

About the second neighborhood conjecture for tournaments missing two stars or disjoint paths
by: Daamouch, Moussa, et al.
Published: (2024)

Cut covers of acyclic digraphs
by: Krone, Maximilian
Published: (2024)

Density conditions for $k$ vertex-disjoint triangles in tripartite graphs
by: Guo, Mingyang, et al.
Published: (2025)

Extremal digraphs containing at most $t$ paths of length 2 with the same endpoints
by: Huang, Zejun, et al.
Published: (2024)

Paired $(n-1)$-to-$(n-1)$ disjoint path covers in bipartite transposition-like graphs
by: Coleman, Anna, et al.
Published: (2024)

Openly disjoint cycles and directed tree-width of regular digraphs
by: Steiner, Raphael
Published: (2026)

Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation
by: Liu, Chun-Hung, et al.
Published: (2020)

Degree conditions for spanning expansion hypertrees
by: Rao, Mengjiao, et al.
Published: (2025)

On Hamiltonian bypasses in digraphs and bipartite digraphs
by: Darbinyan, Samvel Kh.
Published: (2025)

Eigenvalue conditions implying edge-disjoint spanning trees and a forest with constraints
by: Cai, Jin, et al.
Published: (2025)

Paired 2-disjoint path covers of Bcube under the partitioned edge fault model
by: Zhang, Wenjing, et al.
Published: (2025)

The maximum number of cliques in disjoint copies of graphs
by: Gao, Zhipeng, et al.
Published: (2025)

A new sufficient condition for a 2-strong digraph to be Hamiltonian
by: Darbinyan, Samvel Kh.
Published: (2023)

Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs
by: Liu, Chun-Hung, et al.
Published: (2024)

A new condition on dominated pair degree sum for a digraph to be supereulerian
by: Dong, Changchang, et al.
Published: (2024)

Edge-connectivity and pairwise disjoint perfect matchings in regular graphs
by: Ma, Yulai, et al.
Published: (2022)

Degree conditions forcing directed cycles
by: Grzesik, Andrzej, et al.
Published: (2021)

Packing edge disjoint cliques in graphs
by: Balogh, József, et al.
Published: (2025)

Edge-disjoint linkage in infinite graphs
by: Assem, Amena, et al.
Published: (2025)