Decompositions of complete graphs into triangles and Hamilton cycles
暂无分享,去创建一个
[1] Paul N. Balister. On The Alspach Conjecture , 2001, Comb. Probab. Comput..
[2] Peter Adams,et al. 3,5‐Cycle decompositions , 1998 .
[3] Mateja Šajna. Cycle decompositions III: Complete graphs and fixed length cycles , 2002 .
[4] Brian Alspach,et al. Cycle Decompositions of Kn and Kn-I , 2001, J. Comb. Theory, Ser. B.
[5] Christopher A. Rodger,et al. TWO-DIMENSIONAL BALANCED SAMPLING PLANS EXCLUDING CONTIGUOUS UNITS , 2002 .
[6] Raphael Yuster,et al. List decomposition of graphs , 2002, Discret. Math..
[7] Charles J. Colbourn,et al. Quadratic leaves of maximal partial triple systems , 1986, Graphs Comb..
[8] Jean-Claude Bermond,et al. Hamiltonian decomposition of Cayley graphs of degree 4 , 1989, J. Comb. Theory, Ser. B.
[9] James E. Simpson,et al. Langford sequences: perfect and hooked , 1983, Discret. Math..
[10] Katherine Heinrich,et al. On Alspach's conjecture , 1989, Discret. Math..
[11] Hung-Lin Fu,et al. Group Divisible Designs with Two Associate Classes: n=2 orm=2 , 1998, J. Comb. Theory, Ser. A.
[12] Peter Adams,et al. On Alspach's conjecture with two even cycle lengths , 2000, Discret. Math..
[13] Rolf S. Rees,et al. Uniformly resolvable pairwise balanced designs with blocksizes two and three , 1987, J. Comb. Theory, Ser. A.
[14] Richard M. Wilson,et al. Embeddings of Steiner triple systems , 1973, Discret. Math..