On the Hamilton-Waterloo problem

DOI10.1007/S003730200001zbMATH Open0995.05116OpenAlexW2092787561MaRDI QIDQ1348664FDOQ1348664

Authors: Darryn Bryant, S. I. El-Zanati, P. Adams, Elizabeth J. Billington 

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

Recommendations

• On the generalized Oberwolfach problem
• SOME RESULTS ON THE OBERWOLFACH PROBLEM
• Note on three table Oberwolfach problem
• On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity
• The Hamilton-Waterloo problem with even cycle lengths

zbMATH Keywords

decompositionfactorizationsHamilton-Waterloo problemOberwolfach problemcycle-systems

Mathematics Subject Classification ID

Other designs, configurations (05B30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (29)

• The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
• On the Hamilton-Waterloo problem for bipartite 2-factors
• A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors
• Hamilton decompositions of balanced complete multipartite graphs with primitive leaves
• Hamilton decompositions of graphs with primitive complements
• On the Nile problem by Sir Ronald Fisher
• A cyclic solution for an infinite class of Hamilton-Waterloo problems
• Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
• The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors
• A survey on constructive methods for the Oberwolfach problem and its variants
• Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices
• On the generalized Oberwolfach problem
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
• Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem
• On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes
• Hamilton cycle rich 2-factorization of complete equipartite graphs. II
• The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
• Resolution of the Oberwolfach problem
• Uniformly resolvable \((C_4, K_{1,3})\)-designs of index 2
• Factorizations of complete graphs into cycles and 1-factors
• The Hamilton-Waterloo problem for triangle-factors and heptagon-factors
• Two-factorizations of the complete graph
• Uniformly resolvable cycle decompositions with four different factors
• On sharply vertex transitive 2-factorizations of the complete graph
• The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles
• On a generalization of the Oberwolfach problem
• On the honeymoon Oberwolfach problem
• The Hamilton-Waterloo problem for cycle sizes 3 and 4
• Title not available (Why is that?)

This page was built for publication: On the Hamilton-Waterloo problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348664)