, Volume 5, Issue 1, pp 213-221

Near 2-factorizations of 2K n : Cycles of even length

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We show that the edges of the complete multigraph 2K mk+ 1 can be partitioned intomk + 1 factors, each the union ofmk-cycles, for all evenk, k ≥ 4.

Both authors are grateful to the Mathematics Department at Queen's University for the hospitality extended to them while visiting.
The author acknowledges the financial support of the Natural Sciences and Engineering Research Council of Canada under Grant No. A7829.