Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments

Recommendations

Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
Vertex-disjoint cycles in regular tournaments
A step toward the Bermond-Thomassen conjecture about disjoint cycles in digraphs
Vertex-disjoint cycles in local tournaments
Two proofs of Bermond-Thomassen conjecture for regular tournaments

Cites work

A step toward the Bermond-Thomassen conjecture about disjoint cycles in digraphs
Cycles in digraphs– a survey
Digraphs
Disjoint cycles in digraphs
Disjoint directed cycles
Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree

Cited in

(31)

An improved bound for disjoint directed cycles
Vertex disjoint 4-cycles in bipartite tournaments
On the number of disjoint 4-cycles in regular tournaments
Vertex-disjoint cycles in local tournaments
An improvement of Lichiardopol's theorem on disjoint cycles in tournaments
Disjoint properly colored cycles in edge-colored complete bipartite graphs
Disjoint cycles of different lengths in 3-regular digraphs
On disjoint cycles of the same length in tournaments
Lichiardopol's conjecture on disjoint cycles in tournaments
Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments
Cyclic triangle factors in regular tournaments
Disjoint cycles with different length in 4-arc-dominated digraphs
A note on arc-disjoint cycles in tournaments
Tournaments and Semicomplete Digraphs
Two proofs of Bermond-Thomassen conjecture for regular tournaments
A step toward the Bermond-Thomassen conjecture about disjoint cycles in digraphs
Vertex-disjoint cycles in regular tournaments
Edge disjoint Hamiltonian cycles in highly connected tournaments
Vertex-disjoint cycles of prescribed length on tournaments
On the number of vertex-disjoint cycles in digraphs
Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles
Vertex-disjoint cycles in bipartite tournaments
Vertex-disjoint cycles in bipartite tournaments
Vertex‐disjoint cycles of the same length in tournaments
Disjoint cycles in tournaments and bipartite tournaments
Note on disjoint cycles in multipartite tournaments
Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz
Strong k-transitive oriented graphs with large minimum degree
Extremal results on disjoint cycles in tournaments and bipartite tournaments
Complementary cycles of all lengths in tournaments
Cycles of length three and four in tournaments

This page was built for publication: Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417823)