Adding one edge to planar graphs makes crossing number hard (Q5405864)
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 6278553
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Adding one edge to planar graphs makes crossing number hard |
scientific article; zbMATH DE number 6278553 |
Statements
Adding one edge to planar graphs makes crossing number hard (English)
0 references
3 April 2014
0 references
NP-hard
0 references
crossing number
0 references
graph drawing
0 references
graph embedding
0 references
planar graphs
0 references
topological graph theory
0 references
0.9543246030807496
0 references
0.8801047205924988
0 references
0.8747984766960144
0 references
0.8446990847587585
0 references
0.8438888788223267
0 references
