Title of article
Exponentially many 5-list-colorings of planar graphs
Author/Authors
Thomassen، نويسنده , , Carsten، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
13
From page
571
To page
583
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.
Keywords
List colorings
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2007
Journal title
Journal of Combinatorial Theory Series B
Record number
1527831
Link To Document