On the Hamilton-Waterloo problem

DOI10.1007/S003730200001MaRDI QIDQ1348664zbMATH OpenOpenAlexFDO

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

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)

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

Cited in

(31)

• The seating couples problem in the even case
• On the honeymoon Oberwolfach problem
• Hamilton cycle rich 2-factorization of complete equipartite graphs. II
• On the generalized Oberwolfach problem
• Two-factorizations of the complete graph
• A cyclic solution for an infinite class of Hamilton-Waterloo problems
• Hamilton decompositions of graphs with primitive complements
• Uniformly resolvable cycle decompositions with four different factors
• On a generalization of the Oberwolfach problem
• The Hamilton-Waterloo problem for cycle sizes 3 and 4
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
• The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
• A survey on constructive methods for the Oberwolfach problem and its variants
• On the Hamilton-Waterloo problem for bipartite 2-factors
• Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices
• On sharply vertex transitive 2-factorizations of the complete graph
• A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-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 minisymposium problem
• scientific article; zbMATH DE number 7641237 (Why is no real title available?)
• Hamilton decompositions of balanced complete multipartite graphs with primitive leaves
• Resolution of the Oberwolfach problem
• The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
• On the Nile problem by Sir Ronald Fisher
• The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles
• Uniformly resolvable \((C_4, K_{1,3})\)-designs of index 2
• Factorizations of complete graphs into cycles and 1-factors
• Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
• On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes
• The Hamilton-Waterloo problem for triangle-factors and heptagon-factors

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)