Isomorphic factorizations of complete equipartite graphs

DOI10.1002/jgt.3190070303zbMath0516.05045OpenAlexW1995070350WikidataQ114236109 ScholiaQ114236109MaRDI QIDQ3663336

Stephen Quinn

Publication date: 1983

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190070303

zbMATH Keywords

graph designscomplete multipartite graphsedge-decompositionsisomorphic factorisations

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)

Related Items (4)

The isomorphic factorization of complete tripartite graphs \(K(m,n,s)\).--- A proof of F. Harary, R.W. Robinson and N.C. Wormald's conjectureure ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters ⋮ The complete graph \(t\)-packings and \(t\)-coverings

Cites Work

• Decomposition of \(K_n\) into subgraphs of prescribed type
• Generalized Ramsey theory. IX: Isomorphic factorizations. IV: Isomorphic Ramsey numbers

This page was built for publication: Isomorphic factorizations of complete equipartite graphs