Equitable list coloring of sparse graphs

H. A. Kierstead, Alexandr Kostochka, Zimu Xiang

A proper vertex coloring of a graph is equitable if the sizes of all color classes differ by at most $1$. For a list assignment $L$ of $k$ colors to each vertex of an $n$-vertex gr…