Almost resolvable decompositions of 2Kn into cycles of odd length

https://doi.org/10.1016/0097-3165(88)90053-2Get rights and content
Under an Elsevier user license
open archive

Abstract

We prove that there exists an almost resolvable m-cycle decomposition of 2Kms+1 for all odd m⩾3 and all s⩾1.

Cited by (0)

Research supported by NSERC Grant A7829.

Research supported by NSF Grant DMS-8401263.