Exponentially many 5-list-colorings of planar graphs

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

Citing 4
Cited 3

List colourings of planar graphs

Discrete Mathematics
Every planar graph is 5-choosable

Journal of Combinatorial Theory Series B
Color-critical graphs on a fixed surface

Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
Many 3-colorings of triangle-free planar graphs

Journal of Combinatorial Theory Series B

The chromatic polynomial and list colorings

Journal of Combinatorial Theory Series B
List-color-critical graphs on a fixed surface

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Sub-exponentially many 3-colorings of triangle-free planar graphs

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that every planar graph with n vertices has at least 2^n^/^9 distinct list-colorings provided every vertex has at least five available colors.