The relationship between the thickness of the complete bipartite graph \({K_{n + 1,2n}}\) and the complete tripartite graph \({K_{1,n,2n}}\) (Q3306541)
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 relationship between the thickness of the complete bipartite graph K_n + 1,2n and the complete tripartite graph Kâ,n,2n |
scientific article; zbMATH DE number 7233851
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The relationship between the thickness of the complete bipartite graph \({K_{n + 1,2n}}\) and the complete tripartite graph \({K_{1,n,2n}}\) |
scientific article; zbMATH DE number 7233851 |
Statements
12 August 2020
0 references
thickness
0 references
complete bipartite graph
0 references
plane decomposition
0 references
complete tripartite graph
0 references
0.9843459725379944
0 references
0.8946725130081177
0 references
0.8763192892074585
0 references
0.8567516207695007
0 references
