Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree

DOI10.1137/20M1382398zbMath1498.05064arXiv2011.11605WikidataQ114074127 ScholiaQ114074127MaRDI QIDQ5084095

Raphael M. Steiner

Publication date: 23 June 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.11605

zbMATH Keywords

directed graphsstrong connectivitydegree conditionsdirected cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Vertex degrees (05C07)

Related Items (1)

Vertex-disjoint cycles of different lengths in local tournaments

Cites Work

• Unnamed Item
• Disjoint cycles in digraphs
• Even cycles in directed graphs
• Disjoint directed cycles
• An improved bound for disjoint directed cycles
• Disjoint cycles of different lengths in graphs and digraphs
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Vertex disjoint cycles of different lengths in $d$-arc-dominated digraphs
• Directed tree-width
• Vertex-disjoint cycles of the same length
• On 3-regular digraphs of girth 4
• On 3-regular digraphs without vertex disjoint cycles of different lengths
• Minimum degree conditions for vertex-disjoint even cycles in large graphs
• Disjoint cycles with different length in 4-arc-dominated digraphs
• On vertex disjoint cycles of different lengths in 3-regular digraphs
• Vertex Disjoint Cycles of Different Length in Digraphs
• Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles
• The Directed Grid Theorem
• Splitting digraphs
• Cycles in digraphs– a survey
• The Even Cycle Problem for Directed Graphs
• The Directed Flat Wall Theorem

This page was built for publication: Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree