On the Hamilton–Waterloo problem with odd cycle lengths

DOI10.1002/jcd.21586zbMath1391.05202MaRDI 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

zbMATH Keywords

Hamilton-Waterloo problem; 2-factorizations; resolvable cycle decompositions

Mathematics Subject Classification ID

05C38: Paths and cycles

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

05C12: Distance in graphs