The chromatic polynomial and list colorings

    Research output: Contribution to journalJournal articleResearchpeer-review

    Abstract

    We prove that, if a graph has a list of k available colors at every vertex, then the number of list-colorings is at least the chromatic polynomial evaluated at k when k is sufficiently large compared to the number of vertices of the graph.
    Original languageEnglish
    JournalJournal of Combinatorial Theory. Series B
    Volume99
    Issue number2
    Pages (from-to)474-479
    ISSN0095-8956
    DOIs
    Publication statusPublished - 2009

    Keywords

    • List coloring
    • Chromatic polynomial

    Fingerprint Dive into the research topics of 'The chromatic polynomial and list colorings'. Together they form a unique fingerprint.

    Cite this