Author

Sarah Allred

0 works0 citationsORCID

Recent research

  • AI & ComputingOpen access

    Enumerative Chromatic Choosability

    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...

    The Electronic Journal of Combinatorics2026-10-090 citationsDOI