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.
Original language | English |
---|---|
Pages (from-to) | 79–106 |
Number of pages | 28 |
Journal | Journal of Combinatorial Theory, Series B |
Volume | 129 |
DOIs | |
Publication status | Published - Mar 2018 |
Keywords
- Complete multigraph
- Cycle decomposition
- Edge decomposition