Necessary Condition For Cubic Planar 3-Connected Graph To Be Non-Hamiltonian With Proof Of Barnette'S Conjecture

Mushtaq Ahmad Shah
2014 Zenodo  
A conjecture of Barnette states that, every three connected cubic bipartite pla nar graph is Hamiltonian. This problem has remained open since its formulation. This paper has a threefold purpose. The first is to provide survey of literature surrounding the conjecture. The second is to give the necessary condition for cubic planar three connected graph to be non-Hamiltonian and finally, we shall prove near about 50 year Barnett's conjecture. For the proof of different results using to prove the
more » ... using to prove the results we illustrate most of the results by using counter examples.
doi:10.5281/zenodo.825006 fatcat:3ycgjoqjjnfhtoydzdh7hfiosq