http://openproblemgarden.org/op/edge_list_coloring_conjecture Comments for "Edge list coloring conjecture" en http://openproblemgarden.org/op/edge_list_coloring_conjecture <table cellspacing="10"> <tr> <td> Author(s): <a href="/kpz_equation_central_limit_theorem"></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/edge_coloring">Edge coloring</a>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <div class="envtheorem"><b>Conjecture</b>&nbsp;&nbsp; Let <img class="teximage" src="/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png" alt="$ G $" /> be a loopless multigraph. Then the edge chromatic number of <img class="teximage" src="/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png" alt="$ G $" /> equals the list edge chromatic number of <img class="teximage" src="/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png" alt="$ G $" />. </div> </tr></td> </table> </td> </tr> </table> Graph Theory Coloring Edge coloring http://openproblemgarden.org/op/edge_list_coloring_conjecture#comment Thu, 25 Sep 2008 17:48:52 +0200 tchow 2110 at http://openproblemgarden.org