http://openproblemgarden.org/op/circular_chromatic_number_of_triangle_free_planar_graphs Comments for "Circular coloring triangle-free subcubic planar graphs" en http://openproblemgarden.org/op/circular_chromatic_number_of_triangle_free_planar_graphs <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/ghebleh_mohammad">Ghebleh</a>; <a href="/category/zhu_xuding">Zhu</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/graph_theory">Graph Theory</a> » <a href="/category/coloring">Coloring</a> » <a href="/category/vertex_coloring">Vertex coloring</a>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <div class="envtheorem"><b>Problem</b>&nbsp;&nbsp; Does every triangle-free planar graph of maximum degree three have circular chromatic number at most <img class="teximage" src="/files/tex/bad459acf1e14f972d8bf6c9f92912e0be945739.png" alt="$ \frac{20}{7} $" />? </div> </tr></td> </table> </td> </tr> </table> Ghebleh, Mohammad Zhu, Xuding circular coloring planar graph triangle free Graph Theory Coloring Vertex coloring http://openproblemgarden.org/op/circular_chromatic_number_of_triangle_free_planar_graphs#comment Wed, 20 Jun 2007 07:10:39 +0200 mdevos 401 at http://openproblemgarden.org