A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On Barnette's Conjecture and H^+- property
[article]

2012
*
arXiv
*
pre-print

A conjecture of Barnette states that every 3-connected cubic bipartite plane graph has a Hamilton cycle, which is equivalent to the statement that every simple even plane triangulation admits a partition of its vertex set into two subsets so that each induces a tree. Let G be a simple even plane triangulation and suppose that V_1, V_2, V_3 is a 3-coloring of the vertex set of G. Let B_i, i = 1, 2, 3, be the set of all vertices in V_i of the degree at least 6. We prove that if induced graphs

arXiv:1208.4332v1
fatcat:76qumtsa2zcnnj63k6roebbfx4