Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree

DOI10.1016/j.disc.2009.03.039zbMath1188.05072WikidataQ123286770 ScholiaQ123286770MaRDI QIDQ960967

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

Publication date: 29 March 2010

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

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

zbMATH Keywords

cycle; digraph; degree; tournament

Mathematics Subject Classification ID

05C38: Paths and cycles

05C20: Directed graphs (digraphs), tournaments

Related Items

Vertex-disjoint cycles in regular tournaments, The solution and applications of a combinatorial problem, Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz, Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree, What is on his mind?

Cites Work

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