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

DOI10.1016/0012-365X(94)00039-LzbMath0836.05062OpenAlexW2008087745WikidataQ123159724 ScholiaQ123159724MaRDI QIDQ1901045

Shihui Yang

Publication date: 4 December 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00039-l

zbMATH Keywords

complete tripartite graphisomorphic factorization

Mathematics Subject Classification ID

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

Related Items (3)

The isomorphic factorization of complete tripartite graphsK(m, n, s) into 9 × 2^kisomorphic factors ⋮ On connected \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t\)-residual graphs] ⋮ On ConnectedmMultiply 2 dimensions Composite Hyperplane Complete Graph's Residual Graphs

Cites Work

• Unnamed Item
• Isomorphic factorizations of complete equipartite graphs
• Isomorphic factorizations X: Unsolved problems

This page was built for publication: 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