Abstract
Abstract Thomassen conjectured that every triangle-free planar graph has exponentially many 3-colorings. He proved that it has at least 2 n 1 / 12 / 20000 distinct 3-colorings where n is the number of vertices. We show that it has at least 2 n / 432 3-colorings.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have