1. Eldergill, P.: Decompositions of the complete graph with an even number of vertices. M.Sc. Thesis, McMaster University, Hamilton (1997)
2. Fronček D.: Bi-cyclic decompositions of complete graphs into spanning trees. Discrete Math. 307, 1317–1322 (2007)
3. Fronček D.: Note on factorizations of complete graphs into caterpillars with small diameters. J. Comb. Math. Comb. Comput. 57, 179–186 (2006)
4. Fronček D., Kubesa M.: Factorizations of complete graphs into spanning trees. Congr. Numerantium 154, 125–134 (2002)
5. Kovářová T.: Fixing labelings and factorizations of complete graphs into caterpillars with diameter four. Congr. Numerantium 168, 33–48 (2004)