Almost $$2$$2-perfect $$6$$6-cycle systems
暂无分享,去创建一个
[1] Christopher A. Rodger,et al. 2-perfect M-cycle Systems , 1992, Discret. Math..
[2] Ronald C. Mullin,et al. PBDs and GDDs: The Basics , 2006 .
[3] Brian Alspach,et al. Cycle Decompositions of Kn and Kn-I , 2001, J. Comb. Theory, Ser. B.
[4] Douglas R. Stinson,et al. Steiner pentagon systems , 1984, Discret. Math..
[5] Mingchao Li,et al. Nonisomorphic Maximum Packing and Minimum Covering of Kv with 8-Cycles , 2013, Graphs Comb..
[6] Mingchao Li,et al. Maximum Packings and Minimum Coverings of Kv with Octagons , 2009, Graphs Comb..
[7] Charles C. Lindner,et al. 2-perfectm-cycle systems can be equationally defined form=3, 5, and 7 only , 1996 .
[8] Kevin T. Phelps,et al. The spectrum for 2-perfect 6-cycle systems , 1991, J. Comb. Theory, Ser. A.
[9] Helen Verrall,et al. Cycle decompositions IV: complete directed graphs and fixed length directed cycles , 2003, J. Comb. Theory, Ser. A.
[10] Darryn Bryant,et al. 2-perfect directed m-cycle systems can be equationally defined for m = 3,4, and 5 only , 1996 .
[11] Mateja Šajna. Cycle decompositions III: Complete graphs and fixed length cycles , 2002 .
[12] Alexander Rosa,et al. Another class of balanced graph designs: balanced circuit designs , 1975, Discret. Math..
[13] Charles C. Lindner,et al. Almost 2-perfect 8-cycle systems , 2017 .