Decompositions of complete multigraphs into cycles of varying lengths
arXiv:1508.00645
Abstract
We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching.