On the Hamilton–Waterloo problem with odd cycle lengths
From MaRDI portal
Publication:4642157
DOI10.1002/jcd.21586zbMath1391.05202OpenAlexW2761333931MaRDI QIDQ4642157
Peter Danziger, Tommaso Traetta, Andrea C. Burgess
Publication date: 22 May 2018
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.21586
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items (6)
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 ⋮ On the Hamilton-Waterloo problem with cycle lengths of distinct parities ⋮ 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
This page was built for publication: On the Hamilton–Waterloo problem with odd cycle lengths