Exponentially many 5-list-colorings of planar graphs

    Research output: Contribution to journalJournal articlepeer-review

    Abstract

    We prove that every planar graph with n vertices has at least 2n/9 distinct list-colorings provided every vertex has at least five available colors.
    Original languageEnglish
    JournalJournal of Combinatorial Theory. Series B
    Volume97
    Issue number4
    Pages (from-to)571-583
    ISSN0095-8956
    DOIs
    Publication statusPublished - 2007

    Keywords

    • List colorings

    Fingerprint

    Dive into the research topics of 'Exponentially many 5-list-colorings of planar graphs'. Together they form a unique fingerprint.

    Cite this