Work

The Hamilton–Waterloo Problem for Hamiltonian Cycles and Cm‐Factors

Year: 2026

Type: article

Abstract: ABSTRACT 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 .

Source: Journal of Combinatorial Designs

DOI: 10.1002/jcd.70045

Authors: Mariusz Meszka, Sibel Özkan

Institutions: AGH University of Krakow, Gebze Technical University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funder: Türkiye Bilimsel ve Teknolojik Araştırma Kurumu

Awards: G2341067973, G563844271