Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments

DOI10.1002/jgt.21740zbMath1292.05119OpenAlexW1947520976WikidataQ123348607 ScholiaQ123348607MaRDI QIDQ5417823

Stéphane Bessy, Steéphan Thomassé, Jörgen Bang-Jensen

Publication date: 22 May 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21740

zbMATH Keywords

tournamentsdisjoint cycles

Mathematics Subject Classification ID

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

Related Items (18)

Disjoint cycles of different lengths in 3-regular digraphs ⋮ On disjoint cycles of the same length in tournaments ⋮ An improved bound for disjoint directed cycles ⋮ Lichiardopol's conjecture on disjoint cycles in tournaments ⋮ Vertex‐disjoint cycles of the same length in tournaments ⋮ Disjoint cycles in tournaments and bipartite tournaments ⋮ Vertex disjoint 4-cycles in bipartite tournaments ⋮ On the number of disjoint 4-cycles in regular tournaments ⋮ Vertex-disjoint cycles in bipartite tournaments ⋮ Disjoint cycles with different length in 4-arc-dominated digraphs ⋮ Vertex-disjoint cycles in bipartite tournaments ⋮ Vertex-disjoint cycles in local tournaments ⋮ An improvement of Lichiardopol's theorem on disjoint cycles in tournaments ⋮ On the Number of Vertex-Disjoint Cycles in Digraphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments ⋮ Disjoint properly colored cycles in edge-colored complete bipartite graphs ⋮ Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles

Cites Work

• Disjoint cycles in digraphs
• Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree
• 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
• Digraphs

This page was built for publication: Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments