3 papers
math.CO2025
Enumerative Chromatic Choosability
Sarah Allred, Jeffrey A. Mudrock
Chromatic-choosablility 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 1…
math.CO2024
On Polynomial Representations of Dual DP Color Functions
Jeffrey A. Mudrock, Gabriel Sharbel
DP-coloring (also called correspondence coloring) is a generalization of list coloring that was introduced by Dvořák and Postle in 2015. The chromatic polynomial of a graph is an i…
math.CO2022
A Short Proof that the List Packing Number of any Graph is Well Defined
Jeffrey A. Mudrock
List packing is a notion that was introduced in 2021 (by Cambie et al.). The list packing number of a graph , denoted , is the least such that for any list as…