The decomposition of K v into K 2 × K 5’s

Colbourn C J, Dinitz J H. The CRC Handbook of Combinatorial Designs. 2nd ed. Boca Raton FL: Chapman and Hall/CRC, 2006

Bollobás B. Graph Theory. New York Inc: Springer-Verlag, 1979

Rodger C A. Graph decomposition. Le Matematiche, XLV: 119–140 (1990)

Hwang F K. An isomorphic factorization of the complete graph. J Graph Theory, 19: 333–337 (1995)

Fu H L, Hwang F K, Jimbo M, et al. Decomposing complete graph into K r × K c ’s. J Statist Plann Inference, 119: 225–236 (2004)

Mutoh Y, Morihara T, Jimbo M, et al. The existence of 2 × 4 grid-block designs and their applications. SIAM J Discrete Math, 16: 173–178 (2003)

Mutoh Y, Jimbo M, Fu H L. A resolvable r × c grid-block packing and its application to DNA library screening. Taiwanese J Math, 8: 713–737 (2004)

Beth T, Jungnickel D, Lenz H. Design Theory. Cambridge, UK: Cambridge University Press, 1999

Zhang S, Yin J. Packing of K v with certain graphs of five vertices. J Statist Plann Inference, 106: 387–408 (2002)

Wilson R M. Constructions and uses of pairwise balanced designs. Amsterdam: Math Centrum, 1974, 18–41

Ling A C H, Zhu X J, Colbourn C J, et al. Pairwise balanced designs with consecutive block sizes. Des Codes Cryptogr, 10: 203–222 (1997)

Bose R C. On the construction of balanced incomplete block designs. Ann Eugenics, 9: 353–399 (1939)

Yin J, Assaf A M. Constructions of optimal packing designs. J Combin Des, 6: 245–260 (1998)

Yin J. A survey on maximum distance holey packings. Discrete Appl Math, 121: 279–294 (2002)

Abel R J R, Greig M. Some new RBIBDs with block size 5 and PBDs with block sizes = 1 mod 5. Australas J Combin, 15: 177–202 (1997)