A short list color proof of Grotzsch's theorem

    Research output: Book/ReportReportpeer-review

    Abstract

    We give a short proof of the result that every planar graph of girth $5$is $3$-choosable and hence also of Gr\"{o}tzsch's theorem saying that everyplanar triangle-free graph is $3$-colorable.
    Original languageEnglish
    Number of pages3
    Publication statusPublished - 2000

    Cite this