Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
From MaRDI portal
Publication:960967
DOI10.1016/j.disc.2009.03.039zbMath1188.05072OpenAlexW2069056401WikidataQ123286770 ScholiaQ123286770MaRDI QIDQ960967
Jean-Sébastien Sereni, Nicolas Lichiardopol, 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
Related Items (19)
An improved bound for disjoint directed cycles ⋮ Disjoint cycles of different lengths in graphs and digraphs ⋮ Lichiardopol's conjecture on disjoint cycles in tournaments ⋮ Two disjoint cycles in digraphs ⋮ Disjoint cycles in tournaments and bipartite tournaments ⋮ Vertex disjoint 4-cycles in bipartite tournaments ⋮ Vertex-disjoint cycles in regular tournaments ⋮ The solution and applications of a combinatorial problem ⋮ 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 subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz ⋮ Vertex-disjoint cycles in bipartite tournaments ⋮ Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments ⋮ Vertex-disjoint cycles in local tournaments ⋮ Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree ⋮ What is on his mind? ⋮ On the Number of Vertex-Disjoint Cycles in Digraphs ⋮ Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments
Cites Work
This page was built for publication: Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
