×

Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters. (English) Zbl 0866.05050

The author completely determines the pairs \((m,n)\) (the triples \((k,m,n)\)) for which there exists a decomposition of \(K_{m,n}\) \((K_{k,m,n}\), respectively) into two isomorphic factors with a finite diameter.

MSC:

05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Behzad, M., Chartrand, G., Lesniak-Foster, L.: Graphs and Digraphs, Prindle, Weber & Schmidt, Boston, 1979
[2] Bosák, J., Rosa, A., Znám, Š.: On decompositions of complete graphs into factors with given diameters. Theory of Graphs, Proc. Coll. Tihany 1966, Akadémiai Kiadó, Budapest, 1968, pp. 37–56
[3] Das, P.K.: Almost selfcomplementary graphs I. Ars Combinatoria31, 267–276 (1991) · Zbl 0747.05088
[4] Fronček, D., Širáň, J.: Halving complete 4-partite graphs, submitted · Zbl 0994.05117
[5] Fronček, D.: Decompositions of complete multipartite graphs into selfcomplementary factors with given diameters. Australas. J. of Combinatorics (in press) · Zbl 0844.05075
[6] Gangopadhyay, T.: Range of diameters in a graph and itsr-partite complement. Ars Combinatoria18, 61–80 (1983) · Zbl 0558.05035
[7] Gangopadhyay, T., Rao Hebbare, S.P.: Multipartite self-complementary graphs. Ars Combinatoria13, 87–114 (1982) · Zbl 0496.05046
[8] Híc, P., Palumbíny, D: Isomorphic factorizations of complete graphs into factors with a given diameter. Math. Slovaca37, 247–254 (1987)
[9] Kotzig, A., Rosa, A.: Decomposition of complete graphs into isomorphic factors with a given diameter. Bull. London Math. Soc.7, 51–57 (1975) · Zbl 0308.05128 · doi:10.1112/blms/7.1.51
[10] Palumbíny, D.: Factorizations of complete graphs into isomorphic factors with a given diameter. Zbornik Pedagogickej Fakulty v Nitre, vol. Matematika 2, 1982, pp. 21–32
[11] Quin, S.J.: Isomorphic factorizations of complete equipartite graphs. J. Graph Theory7, 285–310 (1983) · Zbl 0516.05045 · doi:10.1002/jgt.3190070303
[12] Tomasta, P.: Decompositions of completek-uniform hypergraphs into factors with given diameters, CMUC17, 377–392 (1976) · Zbl 0327.05129
[13] Tomasta, P.: Decompositions of graphs and hypergraphs into isomorphic factors with a given diameter. Czechoslovak Math. J.27, 598–608 (1977) · Zbl 0384.05048
[14] Tomová, E.: Decomposition of complete bipartite graphs into factors with given diameters. Math. Slovaca27, 113–128 (1977) · Zbl 0357.05066
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.