A short proof of the planarity characterization of Colin de Verdière
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.
scientific article; zbMATH DE number 839125