Edge-disjoint Hamilton cycles in graphs
From MaRDI portal
Publication:713971
DOI10.1016/j.jctb.2011.10.005zbMath1251.05091arXiv0908.4572OpenAlexW2114629872MaRDI QIDQ713971
Daniela Kühn, Deryk Osthus, Demetres Christofides
Publication date: 19 October 2012
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0908.4572
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (15)
Packing tight Hamilton cycles in 3-uniform hypergraphs ⋮ Proof of the 1-factorization and Hamilton Decomposition Conjectures ⋮ Lower bounds for the algebraic connectivity of graphs with specified subgraphs ⋮ Counting and packing Hamilton cycles in dense graphs and oriented graphs ⋮ A survey on Hamilton cycles in directed graphs ⋮ Hamilton decompositions of regular expanders: applications ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ On prisms, Möbius ladders and the cycle space of dense graphs ⋮ Compatible Hamilton cycles in Dirac graphs ⋮ Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree ⋮ Structural properties of subdivided-line graphs ⋮ Locating any two vertices on Hamiltonian cycles in large graphs ⋮ Approximate Hamilton decompositions of random graphs ⋮ Edge-disjoint Hamilton cycles in random graphs ⋮ On magic and consecutive antimagic factorizations of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph factors and factorization: 1985--2003: a survey
- Minimum degree of a graph and the existence of k-factors
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs
- Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs
- Hamilton decompositions of regular tournaments
- Edge-Disjoint Hamilton Cycles in Regular Graphs of Large Degree
- Some Theorems on Abstract Graphs
- The Factors of Graphs
This page was built for publication: Edge-disjoint Hamilton cycles in graphs