Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters
From MaRDI portal
Publication:2563419
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.
Cites work
- Decomposition of Complete Graphs into Isomorphic Factors with a Given Diameter
- scientific article; zbMATH DE number 3889563 (Why is no real title available?)
- scientific article; zbMATH DE number 3781220 (Why is no real title available?)
- scientific article; zbMATH DE number 21751 (Why is no real title available?)
- scientific article; zbMATH DE number 3512169 (Why is no real title available?)
- scientific article; zbMATH DE number 3556148 (Why is no real title available?)
- scientific article; zbMATH DE number 3596892 (Why is no real title available?)
- scientific article; zbMATH DE number 1792591 (Why is no real title available?)
- scientific article; zbMATH DE number 874209 (Why is no real title available?)
- Isomorphic factorizations of complete equipartite graphs
Cited in
(4)
This page was built for publication: Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563419)