A short proof of the planarity characterization of Colin de Verdière (Q1907102)
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 839125
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A short proof of the planarity characterization of Colin de Verdière |
scientific article; zbMATH DE number 839125 |
Statements
A short proof of the planarity characterization of Colin de Verdière (English)
0 references
22 February 1996
0 references
The author presents a nice and short proof of the fact that a graph is planar if its Colin de Verdière number is at most three.
0 references
planar
0 references
Colin de Verdière number
0 references
0.8557823
0 references
0.83978814
0 references
0 references
0.8340794
0 references
0.83201385
0 references
0.82723993
0 references
0.82674474
0 references
0.82422835
0 references
