A short proof of the planarity characterization of Colin de Verdière

H. Holst, van der

    Research output: Contribution to journalArticleAcademicpeer-review

    19 Citations (Scopus)
    1 Downloads (Pure)

    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 languageEnglish
    Pages (from-to)269-272
    Number of pages4
    JournalJournal of Combinatorial Theory, Series B
    Volume65
    Issue number2
    DOIs
    Publication statusPublished - 1995

    Fingerprint

    Dive into the research topics of 'A short proof of the planarity characterization of Colin de Verdière'. Together they form a unique fingerprint.

    Cite this