Near 2-factorizations of 2Kn: Cycles of even length
- 35 Downloads
We show that the edges of the complete multigraph 2Kmk+ 1 can be partitioned intomk + 1 factors, each the union ofmk-cycles, for all evenk, k ≥ 4.
Unable to display preview. Download preview PDF.
© Springer-Verlag 1989