http://openproblemgarden.org/op/3_decomposition_conjecture Comments for "3-Decomposition Conjecture" en http://openproblemgarden.org/op/3_decomposition_conjecture <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/arthur">Arthur</a>; <a href="/category/hoffmann_ostenhof">Hoffmann-Ostenhof</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/graph_theory">Graph Theory</a>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <div class="envtheorem"><b>Conjecture</b>&nbsp;&nbsp; (3-Decomposition Conjecture) Every connected cubic graph <img class="teximage" src="/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png" alt="$ G $" /> has a decomposition into a spanning tree, a family of cycles and a matching. </div> </tr></td> </table> </td> </tr> </table> Arthur Hoffmann-Ostenhof cubic graph Graph Theory http://openproblemgarden.org/op/3_decomposition_conjecture#comment Tue, 24 Jan 2017 02:39:48 +0100 arthur 60027 at http://openproblemgarden.org