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
(Redirected from Publication:1901045)
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
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
Recommendations
Cites work
Cited in
(9)- scientific article; zbMATH DE number 3937213 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 4012305 (Why is no real title available?)
- scientific article; zbMATH DE number 3867380 (Why is no real title available?)
- scientific article; zbMATH DE number 1792669 (Why is no real title available?)
- 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)