The Hamilton-Waterloo Problem for C3-Factors and Cn-Factors

DOI10.1002/jcd.21561zbMath1374.05182arXiv1609.00453OpenAlexW2625922890MaRDI QIDQ4591506

Li Wang, Fen Chen, Haitao Cao

Publication date: 17 November 2017

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.00453

zbMATH Keywords

2-factorizationcycle decompositionHamilton-Waterloo problem

Mathematics Subject Classification ID

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

Related Items (9)

Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles ⋮ 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 ⋮ Uniformly resolvable cycle decompositions with four different factors ⋮ 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 ⋮ The Hamilton-Waterloo problem with even cycle lengths

This page was built for publication: The Hamilton-Waterloo Problem for C3-Factors and Cn-Factors