On the Hamilton-Waterloo problem
From MaRDI portal
Publication:1348664
DOI10.1007/s003730200001zbMath0995.05116OpenAlexW2092787561MaRDI QIDQ1348664
Darryn E. Bryant, Saad I. El-Zanati, Elizabeth J. Billington, Peter J. Adams
Publication date: 14 May 2002
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730200001
Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors ⋮ 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 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 ⋮ On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors ⋮ Unnamed Item ⋮ The Hamilton-Waterloo problem for cycle sizes 3 and 4 ⋮ Hamilton decompositions of balanced complete multipartite graphs with primitive leaves ⋮ The Hamilton-Waterloo problem for triangle-factors and heptagon-factors ⋮ Resolution of the Oberwolfach problem ⋮ Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices ⋮ The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle ⋮ On a generalization of the Oberwolfach problem ⋮ Hamilton decompositions of graphs with primitive complements ⋮ On sharply vertex transitive 2-factorizations of the complete graph ⋮ Unnamed Item ⋮ Factorizations of complete graphs into cycles and 1-factors
