The Hamilton-Waterloo problem with C8-factors and Cm-factors
Combinatorics
2017-10-10 v1
Abstract
In this paper, we almost completely solve the Hamilton-Waterloo problem with C8- factors and Cm-factors where the number of vertices is a multiple of 8m.
Cite
@article{arxiv.1609.09321,
title = {The Hamilton-Waterloo problem with C8-factors and Cm-factors},
author = {L. Wang and H. Cao},
journal= {arXiv preprint arXiv:1609.09321},
year = {2017}
}
Comments
Hamilton-Waterloo problem; 2-factorization; cycle decomposition