Sciweavers

JCT
2007

Exponentially many 5-list-colorings of planar graphs

13 years 3 months ago
Exponentially many 5-list-colorings of planar graphs
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.
Carsten Thomassen
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where JCT
Authors Carsten Thomassen
Comments (0)