Isomorphic factorizations of complete equipartite graphs

DOI10.1002/JGT.3190070303zbMATH Open0516.05045OpenAlexW1995070350WikidataQ114236109 ScholiaQ114236109MaRDI QIDQ3663336FDOQ3663336

Authors: Stephen J. 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

complete multipartite graphsgraph designsedge-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)

Cites Work

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

Cited In (4)

• The complete graph \(t\)-packings and \(t\)-coverings
• 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
• Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters
• Graph factors and factorization: 1985--2003: a survey

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3663336)