On the number of disjoint 4-cycles in regular tournaments
From MaRDI portal
(Redirected from On the number of disjoint 4-cycles in regular tournaments)
Recommendations
- An improvement of Lichiardopol's theorem on disjoint cycles in tournaments
- Vertex-disjoint cycles in regular tournaments
- Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree
- Vertex-disjoint cycles of prescribed length on tournaments
- Lichiardopol's conjecture on disjoint cycles in tournaments
Cites work
- A step toward the Bermond-Thomassen conjecture about disjoint cycles in digraphs
- Cycles in digraphs– a survey
- Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments
- Disjoint cycles in digraphs
- Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
- 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
(7)- An improvement of Lichiardopol's theorem on disjoint cycles in tournaments
- On disjoint cycles of the same length in tournaments
- Lichiardopol's conjecture on disjoint cycles in tournaments
- On 4-Cycles and 5-Cycles in Regular Tournaments
- scientific article; zbMATH DE number 4039950 (Why is no real title available?)
- Vertex‐disjoint cycles of the same length in tournaments
- Disjoint cycles in tournaments and bipartite tournaments
This page was built for publication: On the number of disjoint 4-cycles in regular tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1708396)
