The Hamilton-Waterloo problem with C₄ and C_m factors
From MaRDI portal
Abstract: The Hamilton-Waterloo problem with uniform cycle sizes asks for a factorization of the complete graph (for odd {em v}) or minus a factor (for even {em v}) where of the factors consist of cycles and of the factors consist of cycles with . In this paper, the Hamilton-Waterloo Problem with cycle and cycle factors for odd is studied and all possible solutions with a few possible exceptions are determined.
Recommendations
- The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles
- The Hamilton-Waterloo problem for Hamilton cycles and \(C_{4k}\)-factors.
- The Hamilton-Waterloo problem with even cycle lengths
- On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity
- The Hamilton-Waterloo Problem for C3-Factors and Cn-Factors
Cites work
- scientific article; zbMATH DE number 3922695 (Why is no real title available?)
- scientific article; zbMATH DE number 3596859 (Why is no real title available?)
- A cyclic solution for an infinite class of Hamilton-Waterloo problems
- Hamiltonian decomposition of lexicographic product
- Octahedral, dicyclic and special linear solutions of some Hamilton-Waterloo problems
- On a variation of the Oberwolfach problem
- On sharply vertex transitive 2-factorizations of the complete graph
- On the Hamilton-Waterloo problem
- On the Hamilton-Waterloo problem for bipartite 2-factors
- The Hamilton-Waterloo problem for cycle sizes 3 and 4
- 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 Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
- The Oberwolfach problem and factors of uniform odd length cycles
- The equipartite Oberwolfach problem with uniform tables
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
Cited in
(19)- A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors
- The Hamilton-Waterloo Problem for C3-Factors and Cn-Factors
- On the Hamilton-Waterloo problem with cycle lengths of distinct parities
- 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 even cycle lengths
- On the minisymposium problem
- Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem
- Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem
- The Hamilton-Waterloo problem for Hamilton cycles and \(C_{4k}\)-factors.
- On the Hamilton-Waterloo problem with odd orders
- Factorizations of complete graphs into cycles and 1-factors
- Uniformly resolvable cycle decompositions with four different factors
- The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles
- Octahedral, dicyclic and special linear solutions of some Hamilton-Waterloo problems
- On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity
- The Hamilton-Waterloo problem for cycle sizes 3 and 4
- scientific article; zbMATH DE number 7641237 (Why is no real title available?)
- Completing the spectrum of almost resolvable cycle systems with odd cycle length
This page was built for publication: The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501060)