A cyclic solution for an infinite class of Hamilton-Waterloo problems

DOI10.1007/s00373-015-1582-xzbMath1339.05301OpenAlexW600271645MaRDI QIDQ292248

Peter Danziger, Marco Buratti

Publication date: 13 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1582-x

zbMATH Keywords

group actionSkolem sequencetwo-factorizationWaterloo problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (9)

Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles ⋮ A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors ⋮ Uniformly resolvable cycle decompositions with four different factors ⋮ Completing the spectrum of almost resolvable cycle systems with odd cycle length ⋮ 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 generalized Oberwolfach problem ⋮ The Hamilton-Waterloo problem with even cycle lengths ⋮ Factorizations of complete graphs into cycles and 1-factors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete solution to the two-table Oberwolfach problems
• Graph products and new solutions to Oberwolfach problems
• Complete solutions to the Oberwolfach problem for an infinite set of orders
• The solution of the bipartite analogue of the Oberwolfach problem
• On the Hamilton-Waterloo problem
• Cyclic Hamiltonian cycle systems of the complete graph.
• On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes
• Two-factorizations of small complete graphs
• The equipartite Oberwolfach problem with uniform tables
• The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
• Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
• On sharply vertex transitive 2-factorizations of the complete graph
• Some constructions for cyclic perfect cycle systems
• The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles
• On bipartite 2-factorizations of kn − I and the Oberwolfach problem
• Octahedral, dicyclic and special linear solutions of some Hamilton-Waterloo problems
• The Hamilton-Waterloo problem for cycle sizes 3 and 4
• The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
• Bipartite 2‐Factorizations of Complete Multipartite Graphs
• 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem

This page was built for publication: A cyclic solution for an infinite class of Hamilton-Waterloo problems