A short proof of the planarity characterization of Colin de Verdière (Q1907102): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:10, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A short proof of the planarity characterization of Colin de Verdière |
scientific article |
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
