Cyclic hamiltonian cycle systems of the complete graph minus a 1-factor

In this paper, we prove that cyclic hamiltonian cycle systems of the complete graph minus a 1-factor, K"n-I, exist if and only if n=2,4(mod8) and n 2p^@a with p an odd prime and @a>=1.

[1]  Brian Alspach,et al.  Cycle Decompositions of Kn and Kn-I , 2001, J. Comb. Theory, Ser. B.

[2]  Rose Peltesohn.  Eine Lösung der beiden Heffterschen Differenzenprobleme , 1939 .

[3]  Andrea Vietri.  Cyclic k-cycle systems of order 2kn + k , 2004 .

[4]  Marco Buratti,et al.  Cyclic Hamiltonian cycle systems of the complete graph , 2004, Discret. Math..

[5]  Marco Buratti.  Cycle decomposition with a sharply vertex transitive automorphism group , 2006 .

[6]  Hung-Lin Fu,et al.  Cyclic m‐cycle systems with m ≤ 32 or m = 2q with q a prime power , 2006 .

[7]  Charles Vanden Eynden,et al.  On the cyclic decomposition of complete graphs into almost-bipartite graphs , 2004, Discret. Math..

[8]  Alan Hartman,et al.  Cyclic One-Factorization of the Complete Graph , 1985, Eur. J. Comb..

[9]  Alessandro Rosa.  On the cyclic decompositions of the complete graph into polygons with an odd number of edges , 1966 .

[10]  D. West.  Introduction to Graph Theory , 1995 .

[11]  Marco Buratti,et al.  Existence of cyclic k-cycle systems of the complete graph , 2003, Discret. Math..

[12]  C. Colbourn,et al.  The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[13]  Charles Vanden Eynden,et al.  On the cyclic decomposition of complete graphs into bipartite graphs , 2001, Australas. J Comb..

[14]  Mateja Šajna.  Cycle decompositions III: Complete graphs and fixed length cycles , 2002 .

[15]  H. Weyl.  Permutation Groups , 2022 .

[16]  Hung-Lin Fu,et al.  Cyclically decomposing the complete graph into cycles , 2004, Discret. Math..