Two proofs of Bermond-Thomassen conjecture for regular tournaments

DOI10.1016/j.endm.2007.01.008zbMath1291.05079OpenAlexW2010264092WikidataQ123277985 ScholiaQ123277985MaRDI QIDQ3439564

Nicolas Lichiardopol, Stéphane Bessy, Jean-Sébastien Sereni

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.endm.2007.01.008

zbMATH Keywords

cycledigraphtournamentcircuitBermond-Thomassen conjecture

Mathematics Subject Classification ID

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

Related Items (2)

Disjoint cycles of different lengths in 3-regular digraphs ⋮ Two disjoint cycles in digraphs

Cites Work

• Unnamed Item
• The partition of a strong tournament
• Partitioning vertices of a tournament into independent cycles
• Cycles in digraphs– a survey

This page was built for publication: Two proofs of Bermond-Thomassen conjecture for regular tournaments