A short proof of the planarity characterization of Colin de Verdière
type: Item
instance of: scholarly article
title: A short proof of the planarity characterization of Colin de Verdière
zbMATH Open document ID: 0841.05025
author: Hein van der Holst
published in: Journal of Combinatorial Theory. Series B
publication date: 1996-02-22T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 839125
zbMATH Keywords: planar
zbMATH Keywords: Colin de Verdière number
reviewed by: Jozef Širáň
MaRDI profile type: Publication
full work available at URL: jctb.1995.1054
OpenAlex ID: W1997066757
DOI: 10.1006/JCTB.1995.1054
Recommended article: On a certain theorem of Colin de Verdière
Recommended article: Q4344214
Recommended article: Column Planarity and Partial Simultaneous Geometric Embedding
Recommended article: A proof of the theorem of Pappus in finite Desarguesian affine planes
Recommended article: Q3816082
Recommended article: Column planarity and partially-simultaneous geometric embedding
Recommended article: The Colin de Verdière number and graphs of polytopes
Recommended article: Q5294921
Recommended article: Short proofs of coloring theorems on planar graphs
Recommended article: A short proof of Hadwiger's characterization theorem
description: scientific article; zbMATH DE number 839125