Abstract
It is shown that the obvious necessary conditions for the existence of a decomposition of the complete multigraph with n vertices and with lambda edges joining each pair of distinct vertices into m-cycles, or into m-cycles and a perfect matching, are also sufficient. This result follows as an easy consequence of more general results which are obtained on decompositions of complete multigraphs into cycles of varying lengths
| Original language | English |
|---|---|
| Pages (from-to) | 42 - 69 |
| Number of pages | 28 |
| Journal | Journal of Combinatorial Designs |
| Volume | 19 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2011 |
| Externally published | Yes |