Decompositions of complete multigraphs into cycles of varying lengths
Combinatorics
2015-08-05 v1
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.
Keywords
Cite
@article{arxiv.1508.00645,
title = {Decompositions of complete multigraphs into cycles of varying lengths},
author = {Darryn Bryant and Daniel Horsley and Barbara Maenhaut and Benjamin R. Smith},
journal= {arXiv preprint arXiv:1508.00645},
year = {2015}
}