Showing 2018Show all
2 papers · 1 filter
math.CO2018
The Hamilton-Waterloo Problem with even cycle lengths
A. C. Burgess, P. Danziger, T. Traetta
The Hamilton-Waterloo Problem HWP asks for a 2-factorization of the complete graph or , the complete graph with the edges of a 1-factor removed, into …
math.CO2018
On the Hamilton-Waterloo Problem with cycle lengths of distinct parities
Andrea Burgess, Peter Danziger, Tommaso Traetta
Let denote the complete graph if is odd and , the complete graph with the edges of a 1-factor removed, if is even. Given non-negative integers $v, M, N…