An improvement of Lichiardopol's theorem on disjoint cycles in tournaments
From MaRDI portal
Publication:2008499
Recommendations
- Lichiardopol's conjecture on disjoint cycles in tournaments
- Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree
- On the number of disjoint 4-cycles in regular tournaments
- On disjoint cycles of the same length in tournaments
- Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments
Cites work
- A step toward the Bermond-Thomassen conjecture about disjoint cycles in digraphs
- A survey on Hamilton cycles in directed graphs
- Cycles in digraphs– a survey
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Degree sum conditions and vertex-disjoint cycles in a graph
- Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments
- Disjoint cycles in digraphs
- Disjoint cycles in graphs with distance degree sum conditions
- Disjoint cycles of different lengths in graphs and digraphs
- Fan-type condition on disjoint cycles in a graph
- On the existence of disjoint cycles in a graph
- On the maximal number of independent circuits in a graph
- On the maximum number of independent cycles in a graph
- On the number of disjoint 4-cycles in regular tournaments
- On vertex-disjoint cycles and degree sum conditions
- The confirmation of a conjecture on disjoint cycles in a graph
- Vertex-disjoint cycles in bipartite tournaments
- Vertex-disjoint cycles in regular tournaments
- Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree
Cited in
(9)- On the number of disjoint 4-cycles in regular tournaments
- On disjoint cycles of the same length in tournaments
- Lichiardopol's conjecture on disjoint cycles in tournaments
- Cyclic triangle factors in regular tournaments
- A note on arc-disjoint cycles in tournaments
- scientific article; zbMATH DE number 1080072 (Why is no real title available?)
- Vertex‐disjoint cycles of the same length in tournaments
- Disjoint cycles in tournaments and bipartite tournaments
- Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree
This page was built for publication: An improvement of Lichiardopol's theorem on disjoint cycles in tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2008499)