Title of article :
Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs
Author/Authors :
Asadi، نويسنده , , Arash and Postle، نويسنده , , Luke and Thomas، نويسنده , , Robin، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2009
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.
Keywords :
Triangle-Free Planar Graphs , Coloring Graphs
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
