We use cookies to ensure that we give you the best experience on our website. You can change your cookie settings at any time. Otherwise, we'll assume you're OK to continue.

Durham University

Computer Science


Publication details for Professor Matthew Johnson

Hilton, A. J. W. & Johnson, Matthew (2006). Cycle decompositions of the complete graph. Ars Combinatoria 81: 311-324.

Author(s) from Durham


For a positive integer n, let G be Kn if n is odd and Kn less a one-factor if n is even. In this paper it is shown that, for non-negative integers p, q and r, there is a decomposition of G into p 4-cycles, q 6-cycles and r 8-cycles if 4p+6q+8r =|E(G)|, q=0 if n < 6 and r=0 if n < 8.