[1] BARANOVlČOVA Z.: On decomposition of complete 2-graphs into factors with given diameters. Acta Fac R. N. Univ. Comen. Math. 24, 1970, 175-180. MR 0294153

[2] BEHZAD M., CHARTRAND G., LESNIAK FOSTER L.: Graphs and Digraphs Prindle. Weber and Schmidt. Boston 1979. MR 0525578

[3] BERGE C.: Graphs and Hypergraphs. North Holland, London, 1973. MR 0357172 | Zbl 0254.05101

[4] BOLLOBAS B.: Extremal Graph Theory. Academic Press. New York. 1978. MR 0506522 | Zbl 0419.05031

[5] BOSÁK J.: Disjoint factors of diameter two in complete graphs. J. Combin. Theory B 16, 1974, 57-63. MR 0351901 | Zbl 0256.05117

[6] BOSÁK J., ERDOS P., ROSA A.: Decomposition of complete graphs into factors with diameter two. Mat. časop 21, 1971, 14-28. MR 0321798

[7] BOSÁK J., ROSA A., ZNÁM Š.: On decompositions of complete graphs into factors with given diameters. In: Theory of graphs. Proc Colloq. Tihany 1966, Akademiai Kiado, Budapest, 1968, 37-56. MR 0233720

[8] BŘEZINA J.: Použitie samočinnych počitačov pri skumani istych rozkladov kompletneho grafu. Mat časop. 23, 1973, 17-33. MR 0325459

[9] CHVATAL V., THOMASSEN C.: Distances in orientations of graphs. J. Combin. Theory B 24, 1978, 61-75 MR 0491326

[10] ERDÓS P., SAUER N., SCHAER J., SPENCER J.: Factorizing the complete graph into factors with large star number. J. Combin. Theory B 18, 1975, 180-183. MR 0364021

[11] GAREY M. R., JOHNSON D.S.: Computers and Intractability. W. H. Freeman and Company. San Francisco, 1979. MR 0519066 | Zbl 0411.68039

[12] KAMEDA T.: On maximally distant spanning trees of a graph. Computing 17, 1976, 115-119. MR 0424597 | Zbl 0335.05102

[13] KOTZIG A., ROSA A.: Decomposition of complete graphs into isomorphic factors with a given diameter. Bull. London Math. Soc. 7, 1975, 51-57. MR 0369175 | Zbl 0308.05128

[14] LOVASZ L.: Coverings and colorings of hypergraphs. Graph Theory and Computing (Hoffman F. et al., eds.), Utilitas Mathematica, Winnipeg, 1973, 3-12. MR 0363980 | Zbl 0322.05114

[15] NASH-WILLIAMS C. St. J. A.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36, 1961. 445-450. MR 0133253 | Zbl 0102.38805

[16] NIEPEL Ľ.: O rozklade kompletneho hypergrafu na faktory s danymi priemermi. Acta Fac. R. N. Univ. Comen. Math 34, 1979, 21-28. MR 0568331

[17] NIEPEL Ľ.: On decomposition of complete graphs into factors with given diameters and radii. Math. Slovaca 30, 1980, 3-11. MR 0568209

[18] PALUMBÍNY D.: On a certain type of decompositions of complete graphs into factors with equal diameters. Mat. časop. 22, 1972, 235-242. MR 0351894 | Zbl 0247.05160

[19] PALUMBÍNY D.: On decompositions of complete graphs into factors with equal diameters. Boll. Unione Mat. Ital. 7, 1973, 420-428. MR 0325465 | Zbl 0264.05124

[20] PALUMBÍNY D., ZNÁM Š.: On decompositions of complete graphs into factors with given radii. Mat. časop. 23, 1973, 306-316. MR 0340113

[21] SAUER N.: On the factorization of the complete graph into factors of diameter 2. J. Combin. Theory 9, 1970, 423-426. MR 0278987

[22] SAUER N., SCHAER J.: On the factorization of the complete graph. J. Combin. Theory B 14, 1973, 1-6. MR 0313129 | Zbl 0253.05144

[23] TOMASTA P.: Decompositions of complete k-uniform hypergraphs into factors with given diameters. Comment. Math. Univ. Carolinae 17, 1976, 377-392. MR 0472607 | Zbl 0327.05129

[24] TOMASTA P.: Decompositions of graphs and hypergraphs into isomorphic factors with a given diameter. Czechoslovak Math. J. 27 (102), 1977, 598-608. MR 0472608 | Zbl 0384.05048

[25] TOMASTA P.: On decompositions of complete k-uniform hypergraphs. Czechoslovak Math. J. 28 (103), 1978, 120-126. MR 0480170 | Zbl 0375.05044

[26] TOMOVÁ E.: On the decompositions of the complete directed graph into factors with given diameters. Mat. časop. 20, 1970, 257-261. MR 0309789

[27] TOMOVÁ E.: Decomposition of complete bipartite graphs into factors with given diameters. Math. Slovaca 27, 1977, 113-128. MR 0476588 | Zbl 0357.05066

[28] TOMOVÁ E.: Decomposition of complete bipartite graphs into factors with given radii. Math. Slovaca 27, 1977, 231-237. MR 0536139 | Zbl 0357.05067

[29] TUTTE W. T.: On the problem of decomposing a graph into n connected factors. J. London Math. Soc. 3, 1961, 221-230. MR 0140438 | Zbl 0096.38001

[30] ZNÁM Š.: Decomposition of the complete directed graph into two factors with given diameters. Mat. časop. 20, 1970, 254-256. MR 0309790 | Zbl 0206.52802

[31] ZNÁM Š.: Decomposition of complete graphs into factors of diameter two. Math. Slovaca 30, 1980, 373-378. MR 0595298 | Zbl 0462.05052

[32] ZNÁM Š.: On a conjecture of Bollobás and Bosák. J. Graph. Theory 6, 1982, 139-146. MR 0655199 | Zbl 0497.05049