A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
From MaRDI portal
Publication:3563954
DOI10.1137/080715792zbMath1191.05054OpenAlexW1988947197WikidataQ123155487 ScholiaQ123155487MaRDI QIDQ3563954
Nicolas Lichiardopol, Jean-Sébastien Sereni, Attila Pór
Publication date: 1 June 2010
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080715792
Related Items
On disjoint cycles of the same length in tournaments ⋮ Vertex-disjoint rainbow cycles in edge-colored graphs ⋮ 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 ⋮ Vertex‐disjoint cycles of the same length in tournaments ⋮ Disjoint cycles in tournaments and bipartite tournaments ⋮ Vertex disjoint 4-cycles in bipartite tournaments ⋮ On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs ⋮ Vertex-disjoint cycles in regular tournaments ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Partition and disjoint cycles in digraphs ⋮ 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 ⋮ Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments ⋮ Vertex-disjoint cycles in local tournaments ⋮ An improvement of Lichiardopol's theorem on disjoint cycles in tournaments ⋮ What is on his mind? ⋮ Vertex disjoint cycles of different lengths in $d$-arc-dominated digraphs ⋮ On the Number of Vertex-Disjoint Cycles in Digraphs ⋮ Properly colored short cycles in edge-colored graphs ⋮ 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
