×

zbMATH — the first resource for mathematics

On decompositions of complete k-uniform hypergraphs. (English) Zbl 0375.05044

MSC:
05C99 Graph theory
PDF BibTeX XML Cite
Full Text: EuDML
References:
[1] J. Bosák A. Rosa Š. Znám: On decompositions of complete graphs into factors with given diameter. Theory of graphs, Proc. Colloq. Tihany 1966, Publ. House Hungarian Acad. Sci. Budapest 1968, 37-56.
[2] J. Bosák P. Erdōs A. Rosa: Decompositions of complete graphs into factors with diameter two. Mat. čas. 21 (1971), 14-28. · Zbl 0213.51003
[3] J. Bosák: Disjoint factors of diameter two in complete graphs. J. Combinatorial Theory B 16 (1974), 57-63. · Zbl 0256.05117
[4] A. Kotzig A. Rosa: Dscomposition of complete graphs into isomorphic factors with a given diameter. Bull. London Math. Soc, 7 (1975), 51-57. · Zbl 0308.05128
[5] D. Palumbiny: On decompositions of complete graphs into factors with equal diameters. Boll. Unione Mat. Ital., 7 (1973), 420-428. · Zbl 0264.05124
[6] D. Palumbiny: On a certain type of decompositions of complete graphs into factors with equal diameters. Mat. čas., 22 (1972), 235 - 242. · Zbl 0247.05160
[7] P. Tomasta: Decompositions of graphs and hypergraphs into isomorphic factors with a given diameter. Czechoslovak Math. J., 27 (102) 1911, 598-608. · Zbl 0384.05048
[8] P. Tomasta: Decompositions of complete k-uniform hypergraphs into factors with given diameters. Comment. Math. Univ. Carolinae, 77(1976), 377-392. · Zbl 0327.05129
[9] E. Tomová: On the decomposition of the complete directed graph into factors with given diameters. Mat. čas., 20 (1970), 257-261. · Zbl 0205.28504
[10] Š. Znám: Decompositions of the complete directed graphs into factors with given diameters. Combinat. Structures and their applications, Proc. Calgary Internat. Confer., 1969, Gordon and Breach, N.Y., (1970), 489-490.
[11] Š. Znám: Decomposition of complete directed graph into two factors with given diameters. Mat. čas., 20 (1970), 254-256. · Zbl 0206.52802
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.