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
From MaRDI portal
Publication:1901045
DOI10.1016/0012-365X(94)00039-LzbMATH Open0836.05062OpenAlexW2008087745WikidataQ123159724 ScholiaQ123159724MaRDI QIDQ1901045FDOQ1901045
Authors: 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
Recommendations
Cites Work
Cited In (9)
- Title not available (Why is that?)
- The sufficiency of the divisibility condition for \(6 \times 2^k\) divides complete tripartite graph \(K(m, n, s)\)
- On connected \(m\) multiply 2 dimensions composite hyperplane complete graph's residual graphs
- On connected \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t]\)-residual graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The isomorphic factorization of complete tripartite graphsK(m, n, s) into 9 × 2kisomorphic factors
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901045)