zbMATH — the first resource for mathematics

Decomposition of complete bipartite graphs into factors with given diameters and radii. (English) Zbl 0599.05048
L. Niepel [ibid. 30, 3-11 (1980; Zbl 0422.05045)] studies the existence of a decomposition of the complete graph into factors with given diameters and radii. In the present paper we study the analogous problem for the complete q-partite graphs. Most of the results are concerned with the case $$q=2$$ of bipartite graphs.

MSC:
 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Full Text:
References:
 [1] BOSÁK J., ROSA A., ZNÁM Š.: On decomposition of complete graphs into factors with given diameters. Theory of graphs, Proceedings of the colloquium held at Tihany, Hungary, September 1966, Akadémiai Kiadó, Budapest 1968, 37-56. · Zbl 0159.54203 [2] HARARY F.: Graph Theory. Addison-Wesley, 1969. · Zbl 0182.57702 [3] NIEPEL Ľ.: On decomposition of complete graph into factors with given diameters and radii. Math. Slovaca 30, 1980, 3-11. · Zbl 0422.05045 [4] TOMOVÁ E.: Decomposition of complete bipartite graphs into factors with given diameters. Math. Slovaca 27, 1977, 113-128. · Zbl 0357.05066 [5] TOMOVÁ E.: Decomposition of complete bipartite graphs into factors with given radii. Math. Slovaca 27, 1977, 231-237. · Zbl 0357.05067
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.