A short list color proof of Grötzsch's theorem

    Research output: Contribution to journalJournal articleResearchpeer-review


    We give a short proof of the result that every planar graph of girth 5 is 3-choosable and hence also of Grotzsch's theorem saying that every planar triangle-free graph is 3-colorable.
    Original languageEnglish
    JournalJournal of Combinatorial Theory, Ser.B
    Issue number1
    Pages (from-to)189-192
    Publication statusPublished - 2003


    Dive into the research topics of 'A short list color proof of Grötzsch's theorem'. Together they form a unique fingerprint.

    Cite this