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

From MaRDI portal
Revision as of 06:09, 10 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A short proof of the planarity characterization of Colin de Verdière
scientific article

    Statements

    A short proof of the planarity characterization of Colin de Verdière (English)
    0 references
    0 references
    22 February 1996
    0 references
    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.
    0 references
    0 references
    planar
    0 references
    Colin de Verdière number
    0 references