Vertex‐disjoint cycles of the same length in tournaments
From MaRDI portal
Publication:6094042
Recommendations
- Vertex-disjoint cycles of prescribed length on tournaments
- Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments
- Lichiardopol's conjecture on disjoint cycles in tournaments
- Vertex-disjoint cycles in bipartite tournaments
- An improvement of Lichiardopol's theorem on disjoint cycles in tournaments
- On disjoint cycles of the same length in tournaments
- Vertex disjoint 4-cycles in bipartite tournaments
- Cycles in a tournament with pairwise zero, one or two given vertices in common
- Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
- On the number of disjoint 4-cycles in regular tournaments
Cites work
- A step toward the Bermond-Thomassen conjecture about disjoint cycles in digraphs
- An improved bound for disjoint directed cycles
- An improvement of Lichiardopol's theorem on disjoint cycles in tournaments
- Combinatorial and computational aspects of graph packing and graph decomposition
- Cycles in digraphs– a survey
- Cyclic triangle factors in regular tournaments
- Digraphs
- Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments
- Disjoint cycles in digraphs
- Disjoint cycles of different lengths in graphs and digraphs
- Disjoint directed cycles
- Lichiardopol's conjecture on disjoint cycles in tournaments
- On disjoint cycles of the same length in tournaments
- Proof of a conjecture of Henning and yeo on vertex-disjoint directed cycles
- Triangle packings and 1-factors in oriented graphs
- Vertex disjoint cycles of different length in digraphs
- Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree
This page was built for publication: Vertex‐disjoint cycles of the same length in tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094042)
