On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors

DOI10.1002/jcd.21312zbMath1260.05117OpenAlexW1566220351MaRDI QIDQ4909344

Darryn E. Bryant, Peter Danziger, Matthew Dean

Publication date: 13 March 2013

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

Full work available at URL: https://espace.library.uq.edu.au/view/UQ:287961/UQ287961_OA.pdf

zbMATH Keywords

graph decomposition2-factorizationgraph factorizationHamilton-Waterloo problem

Mathematics Subject Classification ID

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

Related Items (13)

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 ⋮ 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 with cycle lengths of distinct parities ⋮ Cyclic uniform 2-factorizations of the complete multipartite graph ⋮ The Hamilton-Waterloo problem for triangle-factors and heptagon-factors ⋮ On the generalized Oberwolfach problem ⋮ On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity ⋮ Bipartite 2‐Factorizations of Complete Multipartite Graphs ⋮ 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
• Unnamed Item
• Unnamed Item
• Graph products and new solutions to Oberwolfach problems
• Hamilton decomposable graphs with specified leaves
• On Hamilton cycle decomposition of 6-regular circulant graphs
• The Hamilton-Waterloo problem for two even cycles factors
• Complete solutions to the Oberwolfach problem for an infinite set of orders
• From graceful labellings of paths to cyclic solutions of the Oberwolfach problem
• Hamiltonian decomposition of Cayley graphs of degree 4
• On a variation of the Oberwolfach problem
• The solution of the bipartite analogue of the Oberwolfach problem
• On the Hamilton-Waterloo problem
• On the Oberwolfach problem for complete multigraphs
• On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes
• Two-factorizations of small complete graphs
• Sectionable terraces and the (generalised) Oberwolfach problem
• The Oberwolfach problem and factors of uniform odd length cycles
• On a generalization of the Oberwolfach problem
• The equipartite Oberwolfach problem with uniform tables
• On sharply vertex transitive 2-factorizations of the complete graph
• Some cyclic solutions to the three table Oberwolfach problem
• The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles
• SOME RESULTS ON THE OBERWOLFACH PROBLEM
• The Hamilton-Waterloo problem for Hamilton cycles and triangle-factors
• The Hamilton-Waterloo problem for cycle sizes 3 and 4
• The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
• Some observations on the oberwolfach problem
• Hamilton cycle rich two-factorizations of complete graphs
• A generalization of the Oberwolfach problem
• 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
• On the Oberwolfach problem with two similar length cycles
• Regular Oberwolfach problems and group sequencings

This page was built for publication: On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors