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 (Q1901045)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 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 |
scientific article; zbMATH DE number 810268
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 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 |
scientific article; zbMATH DE number 810268 |
Statements
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 (English)
0 references
4 December 1995
0 references
Let \(t > 1\), \(t\) even, and \(t |(mn + ms + ns)\). It is shown that then a complete tripartite graph \(K(m,n,s)\) has an isomorphic factorization into \(t\) isomorphic subgraphs.
0 references
complete tripartite graph
0 references
isomorphic factorization
0 references
