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. © 2008 Elsevier Inc. All rights reserved.
Thomassen, C. (2009). The chromatic polynomial and list colorings. Journal of Combinatorial Theory. Series B, 99(2), 474–479. https://doi.org/10.1016/j.jctb.2008.09.005