| Titel:
|
Exponentially many 5-list-colorings of planar graphs |
| Type:
|
Journal articleJournal article |
| Person(er):
|
Technical University of Denmark
Email:
|
| Uddrag:
|
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. |
| Publiceret:
|
in journal: Journal of Combinatorial Theory. Series B (ISSN: 0095-8956) (DOI: http://dx.doi.org/10.1016/j.jctb.2006.09.002), vol: 97, issue: 4, pages: 571-583, 2007 |
| DOI:
|
|
|