| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657360 | Journal of Combinatorial Theory, Series B | 2007 | 13 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
