http://openproblemgarden.org/op/nonrepetitive_colourings_of_planar_graphs Comments for "Nonrepetitive colourings of planar graphs" en http://openproblemgarden.org/op/nonrepetitive_colourings_of_planar_graphs <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/alon_n">Alon N.</a>; <a href="/category/grytczuk_j">Grytczuk J.</a>; <a href="/category/haluszczak_m">Hałuszczak M.</a>; <a href="/category/riordan_o">Riordan O.</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>Question</b>&nbsp;&nbsp; Do planar graphs have bounded nonrepetitive chromatic number? </div> </tr></td> </table> </td> </tr> </table> Alon N. Grytczuk J. Hałuszczak M. Riordan O. nonrepetitive colouring planar graphs Graph Theory Coloring Vertex coloring http://openproblemgarden.org/op/nonrepetitive_colourings_of_planar_graphs#comment Mon, 24 Mar 2014 14:32:43 +0100 David Wood 59917 at http://openproblemgarden.org