Journal of Combinatorial Theory, Series AVolume 49, Issue 2, November 1988, Pages 218-232Almost resolvable decompositions of 2Kn into cycles of odd lengthAuthor links open overlay panelKatherine Heinrich ∗, C.C Lindner †, C.A RodgerShow moreShareCitehttps://doi.org/10.1016/0097-3165(88)90053-2Get rights and contentUnder an Elsevier user licenseopen archiveAbstractWe prove that there exists an almost resolvable m-cycle decomposition of 2Kms+1 for all odd m⩾3 and all s⩾1.Previous article in issueNext article in issueRecommended articlesCited by (0)∗Research supported by NSERC Grant A7829.†Research supported by NSF Grant DMS-8401263.Copyright © 1988 Published by Elsevier Inc.