Exponentially many 5-list-colorings of planar graphs

@article{Thomassen2007ExponentiallyM5,
  title={Exponentially many 5-list-colorings of planar graphs},
  author={Carsten Thomassen},
  journal={J. Comb. Theory, Ser. B},
  year={2007},
  volume={97},
  pages={571-583}
}
We prove that every planar graph with n vertices has at least 2n/9 distinct list-colorings provided every vertex has at least five available colors. © 2006 Elsevier Inc. All rights reserved.