Vertex-disjoint cycles of the same length.
From MaRDI portal
Publication:1405099
DOI10.1016/S0095-8956(02)00012-6zbMath1037.05029OpenAlexW2076723884MaRDI QIDQ1405099
Publication date: 25 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0095-8956(02)00012-6
Related Items (9)
Cycles of Given Size in a Dense Graph ⋮ Lichiardopol's conjecture on disjoint cycles in tournaments ⋮ Fan-type condition on disjoint cycles in a graph ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ A Conjecture of Verstraëte on Vertex-Disjoint Cycles ⋮ Packing disjoint cycles over vertex cuts ⋮ Disjoint cycles and \(2\)-factors with Fan-type condition in a graph ⋮ Disjoint Chorded Cycles of the Same Length ⋮ Results and problems on chorded cycles: a survey
Cites Work
- Girth in graphs
- Combinatorics, Paul Erdős is eighty. Vol. 2
- How tight is the Bollobás-Komlós conjecture?
- Tiling Turán theorems
- Vertex-disjoint cycles of the same length
- \(H\)-factors in dense graphs
- On the maximum number of independent cycles in a bipartite graph
- On the girth of hamiltonian weakly pancyclic graphs
- On the maximal number of independent circuits in a graph
This page was built for publication: Vertex-disjoint cycles of the same length.
