Abstract
Colin de Verdière introduced an interesting new invariant µ(G) for graphs G, based on algebraic and analytic properties of matrices associated with G. He showed that the invariant is monotone under taking miners and moreover, that µ(G) = 3 if only if G is planar. In this paper we give a short proof of Colin de Verdière's result that µ(G) = 3 if G is planar.
Original language | English |
---|---|
Pages (from-to) | 269-272 |
Number of pages | 4 |
Journal | Journal of Combinatorial Theory, Series B |
Volume | 65 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1995 |