On the Hamilton-Waterloo problem for bipartite 2-factors

DOI10.1002/JCD.21312MaRDI QIDQ4909344zbMATH OpenOpenAlexFDO

Authors Darryn 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

2-factorizationgraph decompositiongraph factorizationHamilton-Waterloo problem

Mathematics Subject Classification ID

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

Recommendations

• Hamilton-Waterloo problem: bipartite case
• A generalization of the Hamilton-Waterloo problem on complete equipartite graphs
• The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
• On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity
• The Hamilton-Waterloo problem with even cycle lengths

Cites work

• 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
• A generalization of the Oberwolfach problem
• Complete solutions to the Oberwolfach problem for an infinite set of orders
• From graceful labellings of paths to cyclic solutions of the Oberwolfach problem
• Graph products and new solutions to Oberwolfach problems
• Hamilton cycle rich two-factorizations of complete graphs
• Hamilton decomposable graphs with specified leaves
• Hamiltonian decomposition of Cayley graphs of degree 4
• scientific article; zbMATH DE number 5917757 (Why is no real title available?)
• scientific article; zbMATH DE number 3922695 (Why is no real title available?)
• scientific article; zbMATH DE number 2148767 (Why is no real title available?)
• scientific article; zbMATH DE number 2114518 (Why is no real title available?)
• On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes
• On a generalization of the Oberwolfach problem
• On a variation of the Oberwolfach problem
• On Hamilton cycle decomposition of 6-regular circulant graphs
• On sharply vertex transitive 2-factorizations of the complete graph
• On the Hamilton-Waterloo problem
• On the Oberwolfach problem for complete multigraphs
• On the Oberwolfach problem with two similar length cycles
• On twizzler, zigzag and graceful terraces
• Regular Oberwolfach problems and group sequencings
• Sectionable terraces and the (generalised) Oberwolfach problem
• Some cyclic solutions to the three table Oberwolfach problem
• Some observations on the oberwolfach problem
• SOME RESULTS ON THE OBERWOLFACH PROBLEM
• The equipartite Oberwolfach problem with uniform tables
• The Hamilton-Waterloo problem for cycle sizes 3 and 4
• The Hamilton-Waterloo problem for Hamilton cycles and triangle-factors
• The Hamilton-Waterloo problem for two even cycles factors
• The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles
• The Hamilton-Waterloo problem with triangle-factors and Hamilton cycles: the case \(n\equiv 3\pmod{18}\)
• The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
• The Oberwolfach problem and factors of uniform odd length cycles
• The solution of the bipartite analogue of the Oberwolfach problem
• Two-factorisations of complete graphs of orders fifteen and seventeen
• Two-factorizations of small complete graphs

Cited in

(21)

• 2-factors and Hamiltonicity
• Uniformly resolvable cycle decompositions with four different factors
• On the Hamilton-Waterloo problem with cycle lengths of distinct parities
• Cyclic uniform 2-factorizations of the complete multipartite graph
• The Hamilton-Waterloo problem with even cycle lengths
• A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors
• Hamilton-Waterloo problem: bipartite case
• Factorizations of complete graphs into cycles and 1-factors
• Hamilton cycle rich 2-factorization of complete bipartite graphs
• A generalization of the Hamilton-Waterloo problem on complete equipartite graphs
• Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem
• Bipartite 2-factorizations of complete multipartite graphs
• The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors
• On the generalized Oberwolfach problem
• On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity
• The Hamilton-Waterloo problem for triangle-factors and heptagon-factors
• Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem
• A survey on constructive methods for the Oberwolfach problem and its variants
• On the minisymposium problem
• On the directed Hamilton-Waterloo problem with two cycle sizes
• The directed uniform Hamilton-Waterloo problem involving even cycle sizes

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

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