Title of article
The chromatic polynomial and list colorings
Author/Authors
Thomassen، نويسنده , , Carsten، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
6
From page
474
To page
479
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.
Keywords
Chromatic polynomial , list coloring
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2009
Journal title
Journal of Combinatorial Theory Series B
Record number
1528844
Link To Document