1-planar graph
Sign in to savegraph that can be drawn in the Euclidean plane in such a way that each edge has at most one crossing point with a single additional edge
Wikidata facts
- Image
- 3-crossing Heawood graph.svg
Show 1 more fact
- Commons category
- 1-planar graphs
Sources (2)
via Wikidata · CC0
Connections
graph coloring
Entity
time complexity
Entity
International Standard Book Number
Entity
quadrilateral
Entity
digital object identifier
Entity
plane
Entity
line segment
Entity
bibcode
Entity
Q118398
Entity
four color theorem
Entity
dynamic programming
Entity
complete graph
Entity
Q22908627
Entity
planar graph
Entity
NP-complete
Entity
degree
Entity
Eulerian path
Entity
Handle System
Entity
cycle graph
Entity
Mathematical Reviews
Entity