The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
From MaRDI portal
Publication:1876686
DOI10.1016/j.disc.2003.11.031zbMath1066.05109OpenAlexW1968128554MaRDI QIDQ1876686
Roman Nedela, Peter Horák, Alexander Rosa
Publication date: 20 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.031
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items
A cyclic solution for an infinite class of Hamilton-Waterloo problems ⋮ Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles ⋮ On bipartite 2-factorizations of kn − I and the Oberwolfach problem ⋮ The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles ⋮ A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors ⋮ Hamilton cycle rich 2-factorization of complete equipartite graphs. II ⋮ Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs ⋮ Uniformly resolvable cycle decompositions with four different factors ⋮ The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors ⋮ Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem ⋮ Unnamed Item ⋮ Hamilton decompositions of balanced complete multipartite graphs with primitive leaves ⋮ The Hamilton-Waterloo problem for triangle-factors and heptagon-factors ⋮ Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices ⋮ Hamilton decompositions of graphs with primitive complements ⋮ Unnamed Item
Cites Work
- On a variation of the Oberwolfach problem
- The solution of the bipartite analogue of the Oberwolfach problem
- On the Hamilton-Waterloo problem
- On the Oberwolfach problem for complete multigraphs
- Bi-embeddings of the projective space PG(3, 2)
- Two-factorizations of small complete graphs
- The Oberwolfach problem and factors of uniform odd length cycles
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item