On the Hamilton–Waterloo Problem with Odd Orders
From MaRDI portal
Publication:5349281
DOI10.1002/jcd.21552zbMath1369.05168arXiv1510.07079OpenAlexW2964093181MaRDI QIDQ5349281
Tommaso Traetta, Peter Danziger, Andrea C. Burgess
Publication date: 24 August 2017
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.07079
cycle systemsHamilton-Waterloo problem2-factorizationsgeneralized Oberwolfach problemresolvable cycle decompositions
Related Items (13)
Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles ⋮ On the existence of unparalleled even cycle systems ⋮ 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 ⋮ Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment ⋮ Completing the spectrum of almost resolvable cycle systems with odd cycle length ⋮ Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem ⋮ On the Hamilton-Waterloo problem with cycle lengths of distinct parities ⋮ Unnamed Item ⋮ On the generalized Oberwolfach problem ⋮ On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity ⋮ The Hamilton-Waterloo problem with even cycle lengths ⋮ Factorizations of complete graphs into cycles and 1-factors
This page was built for publication: On the Hamilton–Waterloo Problem with Odd Orders
