An improved bound for disjoint directed cycles

DOI10.1016/j.disc.2018.04.027zbMath1388.05076arXiv1701.06364OpenAlexW2582224081MaRDI QIDQ1637139

Matija Bucić

Publication date: 7 June 2018

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

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

zbMATH Keywords

directed graphdisjoint cyclesminimal out-degree

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

On disjoint cycles of the same length in tournaments ⋮ Vertex-disjoint rainbow cycles in edge-colored graphs ⋮ Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree ⋮ Lichiardopol's conjecture on disjoint cycles in tournaments ⋮ Decomposing edge-colored graphs under color degree constraints ⋮ On sufficient conditions for rainbow cycles in edge-colored graphs ⋮ Vertex‐disjoint cycles of the same length in tournaments ⋮ Disjoint cycles in tournaments and bipartite tournaments ⋮ Partition and disjoint cycles in digraphs ⋮ Vertex-disjoint rainbow triangles in edge-colored graphs

Cites Work

• Disjoint cycles in digraphs
• Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
• Disjoint directed cycles
• A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
• Cycles in digraphs– a survey
• Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments
• Unnamed Item

This page was built for publication: An improved bound for disjoint directed cycles