| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657160 | Journal of Combinatorial Theory, Series B | 2009 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
