Article ID Journal Published Year Pages File Type
8903884 Journal of Combinatorial Theory, Series B 2018 28 Pages PDF
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
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Decompositions of complete multigraphs into cycles of varying lengths
Authors
, , , ,