A Short Proof of the Planarity Characterization of Colin de Verdière
✍ Scribed by H. Vanderholst
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 142 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Colin de Verdière matrix Cartesian graph product Kronecker product of matrices Let G be a connected graph with Colin de Verdière number μ(G). We study the behaviour of μ with respect to the Cartesian product of graphs. We conjecture that if where h is the Hadwiger number (i.e. the order of the lar
We present a new short combinatorial proof of the sufficiency part of the well-known Kuratowski's graph planarity criterion. The main steps are to prove that for a minor minimal non-planar graph G and any edge xy: (1) G-x-y does not contain θ-subgraph; (2) G-x-y is homeomorphic to the circle; (3)