Previous |  Up |  Next

Article

References:
[1] BOLLOBÁS B.: Extremal problems in graph theory. J. Gгaph Theory 1, 1977, 117-123. MR 0450129 | Zbl 0376.05041
[2] BOSÁK J.: Disjoint factors of diameter two in complete graphs. J. Combinatorial Theory 16, 1974, 57-63. MR 0351901 | Zbl 0256.05117
[3] BOSÁK J., ERDÖS P., ROSA A.: Decompositions of complete graphs into factors with diameter two. Mat. časopis 21, 1971, 14-28. MR 0321798
[4] BOSÁK J., ROSA A., ZNÁM Š.: On decompositions of complete gгaphs into factoгs with given diameters. In: Theory of Gгaphs, Pгoc. Colloq. Tihany, 1966, Akadémiai Kiadó, Budapest 1968, 37-56.
[5] HARARY F., ROBINSON R. W., WORMALD N. C.: Isomoгphic factoriasation. I.: Complete graphs. Tгans. Ameг. Math. Soc. 242, 243-260. MR 0545305
[6] KÖTZIG A., ROSA A.: Decomposition of complete graphs into isomorphic factoгs with a given diameter. Bull. London Math. Soc. 7, 1975, 51-57. MR 0369175
[7] PALUMBÍNY D.: On decompositions of complete gгaphs into factoгs with equal diameteгs. Boll. Un. Mat. Ital., 7, 1973, 420-428. MR 0325465
[8] PALUMBÍNY D.: Factorisations of complete graphs into isomorphic factoгs with a given diameter. In: Zborník Pedagogickej fakulty v Nitгe, Matematika 2, 1982, 21-32.
[9] SAUER N.: On the factoгisation of the complete graph into factors of diameter 2. J. Combinatorial Theoгy 9, 1970, 423-426. MR 0278987
[10] TOMASTA P.: Decompositions of gгaphs and hypeгgгaphs into isomorphic factors with a given diameter. Czech. Math. J., 27, 1977, 598-608. MR 0472608
[11] TOMASTA P.: On decompositions of complete k-uniform hypergraphs. Czech. Math. J., 28, 1978, 120-126. MR 0480170 | Zbl 0375.05044
[12] ZNÁM Š.: On a conjecture of Bollobás and Bosák. J. Graph Theory, 6, 1982, 139-146. MR 0655199 | Zbl 0497.05049
Partner of
EuDML logo