On Barnette's conjecture (Q968428): Difference between revisions

The famous and long-standing conjecture of Barnette claims that every cubic 3-connected bipartite planar graph is Hamiltonian. The author proves that if a graph contains a 2-factor that consists only of facial 4-cycles than the graph possesses Hamiltonian cycles with additional properties.