Constructing a minimum genus embedding of the complete tripartite graph \(K_{n, n, 1}\) for odd \(n\) (Q2324490)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7103706
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing a minimum genus embedding of the complete tripartite graph \(K_{n, n, 1}\) for odd \(n\) |
scientific article; zbMATH DE number 7103706 |
Statements
Constructing a minimum genus embedding of the complete tripartite graph \(K_{n, n, 1}\) for odd \(n\) (English)
0 references
11 September 2019
0 references
embedding
0 references
genus
0 references
complete tripartite graph
0 references
complete bipartite graph
0 references
0.866798996925354
0 references
0.8123835325241089
0 references
0.8010711073875427
0 references
0.800024151802063
0 references
0.7912406325340271
0 references
