Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree
From MaRDI portal
Publication:708429
DOI10.1016/j.disc.2010.06.024zbMath1227.05157OpenAlexW1993784399MaRDI QIDQ708429
Publication date: 11 October 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.06.024
Related Items (10)
On disjoint cycles of the same length in tournaments ⋮ Lichiardopol's conjecture on disjoint cycles in tournaments ⋮ Vertex‐disjoint cycles of the same length in tournaments ⋮ Disjoint cycles in tournaments and bipartite tournaments ⋮ The solution and applications of a combinatorial problem ⋮ On the number of disjoint 4-cycles in regular tournaments ⋮ 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 ⋮ An improvement of Lichiardopol's theorem on disjoint cycles in tournaments
Cites Work
This page was built for publication: Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree
