| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652319 | Electronic Notes in Discrete Mathematics | 2009 | 7 Pages |
Abstract
Thomassen conjectured that every triangle-free planar graph has exponentially many 3-colorings. He proved that it has at least 2n1/12/20000 distinct 3-colorings where n is the number of vertices. We show that it has at least 3-colorings.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
