A successful concept for measuring non-planarity of graphs: the crossing number (Q2816138)
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: A successful concept for measuring non-planarity of graphs: the crossing number |
scientific article; zbMATH DE number 6600319
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A successful concept for measuring non-planarity of graphs: the crossing number |
scientific article; zbMATH DE number 6600319 |
Statements
1 July 2016
0 references
graph drawing
0 references
crossing number
0 references
Turán numbers
0 references
Szemerédi-Trotter theorems
0 references
bisection width
0 references
graph embedding
0 references
layout area
0 references
VLSI
0 references
A successful concept for measuring non-planarity of graphs: the crossing number (English)
0 references
