Vertex-disjoint cycles in regular tournaments

DOI10.1016/j.disc.2012.03.009zbMath1243.05097OpenAlexW1975414774MaRDI QIDQ427838

Nicolas Lichiardopol

Publication date: 18 June 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2012.03.009

zbMATH Keywords

vertex-disjoint cyclesacyclic tournamentregular tournament

Mathematics Subject Classification ID

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

Related Items (6)

Disjoint cycles of different lengths in 3-regular digraphs ⋮ Disjoint cycles in tournaments and bipartite tournaments ⋮ On the number of disjoint 4-cycles in regular tournaments ⋮ Vertex-disjoint cycles in local tournaments ⋮ An improvement of Lichiardopol's theorem on disjoint cycles in tournaments ⋮ Tournaments and Semicomplete Digraphs

Cites Work

• Unnamed Item
• Combinatorial and computational aspects of graph packing and graph decomposition
• Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
• A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
• Cycles in digraphs– a survey

This page was built for publication: Vertex-disjoint cycles in regular tournaments