| Title:
|
The chromatic polynomial and list colorings |
| Type:
|
Journal articleJournal article |
| Participant(s):
|
Technical University of Denmark
Email:
|
| 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. |
| Published:
|
in journal: Journal of Combinatorial Theory. Series B (ISSN: 0095-8956) (DOI: http://dx.doi.org/10.1016/j.jctb.2008.09.005), vol: 99, issue: 2, pages: 474-479, 2009 |
| DOI:
|
|
|