Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles

DOI10.1137/130922653zbMath1305.05109OpenAlexW2025763748WikidataQ123110762 ScholiaQ123110762MaRDI QIDQ2935291

Nicolas Lichiardopol

Publication date: 22 December 2014

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

Full work available at URL: https://doi.org/10.1137/130922653

zbMATH Keywords

digraphoriented graphvertex-disjoint cyclesminimum out-degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)

Related Items (16)

Vertex-disjoint cycles of different lengths in multipartite tournaments ⋮ Vertex-disjoint rainbow cycles in edge-colored graphs ⋮ Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree ⋮ On 2-Colorings of Hypergraphs ⋮ Disjoint cycles of different lengths in graphs and digraphs ⋮ Properly colored cycles of different lengths in edge-colored complete graphs ⋮ Vertex‐disjoint cycles of the same length in tournaments ⋮ Vertex-disjoint cycles of different lengths in local tournaments ⋮ Disjoint cycles in tournaments and bipartite tournaments ⋮ Partition and disjoint cycles in digraphs ⋮ Vertex-disjoint rainbow triangles in edge-colored graphs ⋮ On 3-regular digraphs of girth 4 ⋮ On the Number of Vertex-Disjoint Cycles in Digraphs ⋮ Properly colored short cycles in edge-colored graphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths

This page was built for publication: Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles