{
  "abstract": "Chromatic-choosability is a notion of fundamental importance in list coloring. A graph is chromatic-choosable when its chromatic number is equal to its list chromatic number. In 1990, Kostochka and Sidorenko introduced the list color function of a graph $G$, denoted $P_{\\ell}(G,m)$, which is the list analogue of the chromatic polynomial of $G$, $P(G,m)$. It is known that for any graph $G$ there is a positive integer $k$ such that $P_{\\ell}(G,m) = P(G,m)$ whenever $m \\geq k$. In this paper, we study enumerative chromatic-choosability. A graph $G$ is enumeratively chromatic-choosable when $P_{\\ell}(G,m) = P(G,m)$ whenever $m \\in \\mathbb{N}$. We completely determine the graphs of chromatic number two that are enumeratively chromatic-choosable. We construct examples of graphs that are chromatic-choosable but fail to be enumeratively chromatic-choosable, and finally, we explore a conjecture as to whether for every graph $G$, there is a $p \\in \\mathbb{N}$ such that the join of $G$ and $K_p$ is enumeratively chromatic-choosable. The techniques we use to prove results are diverse and include probabilistic ideas and ideas from DP (or correspondence)-coloring.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": null,
  "author_total": 2,
  "authors": [
    {
      "name": "Sarah Allred"
    },
    {
      "name": "Jeffrey Allen Mudrock"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/686n067krfn6d.bib",
  "cited_by": 0,
  "doi": "10.37236/14176",
  "fulltext_url": null,
  "id": "686n067krfn6d",
  "issns": [
    "1077-8926"
  ],
  "landing_url": "https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i4p6",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "journal",
  "licence_url": "https://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "openalex",
      "1703|Advanced Graph Theory Research"
    ]
  ],
  "openalex": "W4417084840",
  "pdf_url": "https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i4p6/pdf",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-09",
  "publisher": "The Electronic Journal of Combinatorics",
  "ris": "https://research.draconitic.com/paper/686n067krfn6d.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:18:24Z",
      "native_id": "10.37236/14176",
      "source": "crossref",
      "url": "https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i4p6"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "issn:1077-8926",
      "subfield": "combinatorics"
    }
  ],
  "title": "Enumerative Chromatic Choosability",
  "title_text": "Enumerative Chromatic Choosability",
  "type": "peer-reviewed",
  "updated_at": "2026-10-30T12:18:24Z",
  "url": "https://research.draconitic.com/paper/686n067krfn6d",
  "venue": "The Electronic Journal of Combinatorics",
  "versions": []
}