The Hamilton–Waterloo Problem for Hamiltonian Cycles and Cm‐Factors
Journal of Combinatorial Designs · 30.10.2026
DOI: 10.1002/jcd.70045 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Designs, online erschienen am 30.10.2026. Verfasst von Mariusz Meszka und 1 weiteren Autor:innen. Die Arbeit nennt 15 Literaturangaben.
Abstract (Originalsprache)
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 .
Zitieren
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