The sufficiency of the divisibility condition for \(6 \times 2^k\) divides complete tripartite graph \(K(m, n, s)\) (Q5069795)
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 sufficiency of the divisibility condition for 6 2ᵏ divides complete tripartite graph K(m, n, s) |
scientific article; zbMATH DE number 7509125
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The sufficiency of the divisibility condition for \(6 \times 2^k\) divides complete tripartite graph \(K(m, n, s)\) |
scientific article; zbMATH DE number 7509125 |
Statements
The sufficiency of the divisibility condition for 6 × 2<i><sup>k</sup></i>divides complete tripartite graph<i>K</i>(<i>m, n, s</i>) (English)
0 references
19 April 2022
0 references
isomorphic factorization
0 references
complete tripartite graph
0 references
0.844649076461792
0 references
0.8424313068389893
0 references
