Graphs and Combinatorics

, Volume 5, Issue 1, pp 213–221

Near 2-factorizations of 2Kn: Cycles of even length

  • James Burling
  • Katherine Heinrich
Article

DOI: 10.1007/BF01788673

Cite this article as:
Burling, J. & Heinrich, K. Graphs and Combinatorics (1989) 5: 213. doi:10.1007/BF01788673

Abstract

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.

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • James Burling
    • 1
  • Katherine Heinrich
    • 2
  1. 1.SUNYOswegoUSA
  2. 2.SFUBurnabyCanada

Personalised recommendations