Some constructions for cyclic perfect cycle systems

We present direct and recursive constructions for some classes of cyclic i-perfect k-cycle systems with special attention to cyclic Steiner k-cycle systems and cyclic Kirkman k-cycle systems.

[1]  Kevin T. Phelps,et al.  Steiner triple systems with rotational automorphisms , 1981, Discret. Math..

[2]  Clement W. H. Lam,et al.  Difference Families , 2001, Des. Codes Cryptogr..

[3]  L. Zhu,et al.  Existence of (q,6,1) Difference Families withq a Prime Power , 1998, Des. Codes Cryptogr..

[4]  J. Bermond,et al.  Graph decompositions and G-designs , 1976 .

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

[6]  R. Julian R. Abel,et al.  Existence of Steiner seven-cycle systems , 2002, Discret. Math..

[7]  Marco Buratti.  From a (G, k, 1) to a (Ck ⊕ G, k, 1) Difference Family , 1997, Des. Codes Cryptogr..

[8]  M. Buratti.  Recursive constructions for difference matrices and relative difference families , 1998 .

[9]  Marco Buratti,et al.  Cyclic Designs with Block Size 4 and Related Optimal Optical Orthogonal Codes , 2002, Des. Codes Cryptogr..

[10]  Hanfried Lenz,et al.  Design theory , 1985 .

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

[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]  Alan C. H. Ling,et al.  Skolem-type Difference Sets for Cycle Systems , 2003, Electron. J. Comb..

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

[15]  Marco Buratti.  Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems , 2003 .

[16]  Peter Adams,et al.  Completing some spectra for 2-perfect cycle systems , 1993, Australas. J Comb..

[17]  Miwako Mishima,et al.  Cyclic resolvability of cyclic Steiner 2-designs , 1997 .

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

[19]  Marco Buratti.  Existence of 1-Rotational k-Cycle Systems of the Complete Graph , 2004, Graphs Comb..

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

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

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

[23]  C. Colbourn,et al.  Recursive constructions for cyclic block designs , 1984 .

[24]  Christopher A. Rodger,et al.  2-perfect M-cycle Systems , 1992, Discret. Math..

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

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

[27]  Douglas R. Stinson,et al.  Steiner pentagon systems , 1984, Discret. Math..