Algorithmic proof of Barnette's Conjecture

Details Algorithmic proof of Barnette's Conjecture Algorithmic proof of Barnette's Conjecture

2009-04-22

arxiv.org/abs/0904.3431v1

Mathematics

General Mathematics

13 pages, 6 figures, draft paper

Scientific paper

In this paper we have given an algorithmic proof of an long standing Barnette's conjecture (1969) that every 3-connected bipartite cubic planar graph is hamiltonian. Our method is quite different than the known approaches and it rely on the operation of opening disjoint chambers, bu using spiral-chain like movement of the outer-cycle elastic-sticky edges of the cubic planar graph. In fact we have shown that in hamiltonicity of Barnette graph a single-chamber or double-chamber with a bridge face is enough to transform the problem into finding specific hamiltonian path in the cubic bipartite graph reduced. In the last part of the paper we have demonstrated that, if the given cubic planar graph is non-hamiltonian then the algorithm which constructs spiral-chain (or double-spiral chain) like chamber shows that except one vertex there exists (n-1)-vertex cycle.

Affiliated with

Also associated with

No associations

Rating

Algorithmic proof of Barnette's Conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithmic proof of Barnette's Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmic proof of Barnette's Conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-274998