The Hamilton–Waterloo Problem for Hamiltonian Cycles and Cm‐Factors
Journal of Combinatorial Designs · 2026-10-30
DOI: 10.1002/jcd.70045 ↗At a glance
Journal article in Journal of Combinatorial Designs, published online on 2026-10-30. Written by Mariusz Meszka and 1 co-authors. 15 references.
Abstract (original language)
The Hamilton‐Waterloo problem asks for the existence of a 2‐factorization of the complete graph of odd order in which of the 2‐factors are isomorphic to a given 2‐factor , and of the 2‐factors are isomorphic to a given 2‐factor , with . We provide a complete constructive solution to this problem in the case when 2‐factors are either Hamiltonian cycles or consist of ‐cycles only, where is odd and .
Cite
APA
Meszka, M., & Özkan, S. (2026). The Hamilton–Waterloo Problem for Hamiltonian Cycles and Cm‐Factors. Journal of Combinatorial Designs. https://doi.org/10.1002/jcd.70045
Vancouver
Meszka M, Özkan S. The Hamilton–Waterloo Problem for Hamiltonian Cycles and Cm‐Factors. Journal of Combinatorial Designs. 2026. doi:10.1002/jcd.70045
BibTeX
@article{Meszka2026,
author = {Meszka, Mariusz and Özkan, Sibel},
title = {The Hamilton–Waterloo Problem for Hamiltonian Cycles and Cm‐Factors},
journal = {Journal of Combinatorial Designs},
year = {2026},
doi = {10.1002/jcd.70045}
}
EUVIMED