The chromatic polynomial and list colorings

Authors:
Carsten Thomassen
Affiliations:
Department of Mathematics, Technical University of Denmark, DK-2800 Lyngby, Denmark
Venue:
Journal of Combinatorial Theory Series B
Year:
2009

Citing 7
Cited 0

List colourings of planar graphs

Discrete Mathematics
Restricted colorings of graphs

Surveys in combinatorics, 1993
Every planar graph is 5-choosable

Journal of Combinatorial Theory Series B
The list chromatic index of a bipartite multigraph

Journal of Combinatorial Theory Series B
A not 3-choosable planar graph without 3-cycles

Discrete Mathematics
Many 3-colorings of triangle-free planar graphs

Journal of Combinatorial Theory Series B
Exponentially many 5-list-colorings of planar graphs

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

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.