| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656946 | Journal of Combinatorial Theory, Series B | 2013 | 7 Pages |
Abstract
Thomassen conjectured that every triangle-free planar graph on n vertices has exponentially many 3-colorings, and proved that it has at least 2n1/12/20000 distinct 3-colorings. We show that it has at least 2n/212 distinct 3-colorings.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Arash Asadi, Zdeněk Dvořák, Luke Postle, Robin Thomas,