The Colin de Verdière number and sphere representations of a graph
- Andrew KotlovAffiliated withDept. of Mathematics, Yale, University
- , László LovászAffiliated withDept. of Computer Science, Yale, University
- , Santosh VempalaAffiliated withDept. of Computer Science, Carnegie Mellon University
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
Colin de Vedière introduced an interesting linear algebraic invariant μ(G) of graphs. He proved that μ(G)≤2 if and only ifG is outerplanar, and μ(G)≤3 if and only ifG is planar. We prove that if the complement of a graphG onn nodes is outerplanar, then μ(G)≥n−4, and if it is planar, then μ(G)≥n−5. We give a full characterization of maximal planar graphs whose complementsG have μ(G)=n−5. In the opposite direction we show that ifG does not have “twin” nodes, then μ(G)≥n−3 implies that the complement ofG is outerplanar, and μ(G)≥n−4 implies that the complement ofG is planar.
Our main tools are a geometric formulation of the invariant, and constructing representations of graphs by spheres, related to the classical result of Koebe about representing planar graphs by touching disks. In particular we show that such sphere representations characterize outerplanar and planar graphs.
Mathematics Subject Classification (1991)05C
- The Colin de Verdière number and sphere representations of a graph
Volume 17, Issue 4 , pp 483-521
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Industry Sectors