An isomorphic factorization of the complete graph

DOI10.1002/JGT.3190190306MaRDI QIDQ4698083zbMATH OpenOpenAlexFDO

Authors Frank K. Hwang

Publication date 14 May 1995

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

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

zbMATH Keywords

arraycliquecomplete graphisomorphic factorizationorthogonal latin squares

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On biclique partitions of the complete graph
• scientific article; zbMATH DE number 3959482
• Some problems about \(r\)-factorizations of complete graphs
• 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

Cited in

(12)

• Using transforming matrices to generate DNA clone grids
• Decomposing complete graphs into \(K_{r} \times K_{c}\)'s.
• Isomorphic factorization of de Bruijn digraphs
• On connected \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t]\)-residual graphs
• Grid-block difference families and related combinatorial structures
• The decomposition of \(K_v\) into \(K_2\times K_5\)'s
• On connected m multiply 2 dimensions composite hyperplane complete graph's residual graphs
• scientific article; zbMATH DE number 3867380 (Why is no real title available?)
• Resolvable packings ofKvwithK₂ × Kc's
• The existence of \((K_2\times K_6)\)-designs
• The isomorphic factorization of complete tripartite graphsK(m, n, s) into 9 × 2^kisomorphic factors
• The sufficiency of the divisibility condition for \(6 \times 2^k\) divides complete tripartite graph \(K(m, n, s)\)

This page was built for publication: An isomorphic factorization of the complete graph

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