The Hamilton-Waterloo problem for Hamilton cycles and triangle-factors

DOI10.1002/jcd.20311zbMath1252.05105OpenAlexW1503612811MaRDI QIDQ3167096

Hongchuan Lei, Hao Shen

Publication date: 2 November 2012

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20311

zbMATH Keywords

Hamilton cycle2-factorizationtriangle-factor

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors ⋮ Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem ⋮ Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem ⋮ On the Hamilton-Waterloo problem with cycle lengths of distinct parities ⋮ On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors ⋮ The Hamilton-Waterloo problem for triangle-factors and heptagon-factors ⋮ On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity ⋮ The Hamilton-Waterloo problem with even cycle lengths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Frames for Kirkman triple systems
• The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle

This page was built for publication: The Hamilton-Waterloo problem for Hamilton cycles and triangle-factors