An isomorphic factorization of the complete graph

DOI10.1002/jgt.3190190306zbMath0835.05052OpenAlexW2018307815MaRDI QIDQ4698083

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

cliquecomplete grapharrayisomorphic 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)

Related Items (10)

The isomorphic factorization of complete tripartite graphsK(m, n, s) into 9 × 2^kisomorphic factors ⋮ The sufficiency of the divisibility condition for 6 × 2^kdivides complete tripartite graphK(m, n, s) ⋮ The existence of \((K_2\times K_6)\)-designs ⋮ Grid-block difference families and related combinatorial structures ⋮ Using transforming matrices to generate DNA clone grids ⋮ Decomposing complete graphs into \(K_{r} \times K_{c}\)'s. ⋮ The decomposition of \(K_v\) into \(K_2\times K_5\)'s ⋮ On connected \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t\)-residual graphs] ⋮ Resolvable packings ofKvwithK₂ × Kc's ⋮ On ConnectedmMultiply 2 dimensions Composite Hyperplane Complete Graph's Residual Graphs

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