2000 character limit reached
On finding hamiltonian cycles in Barnette graphs (2212.02668v2)
Published 5 Dec 2022 in math.CO
Abstract: In this paper, we deal with hamiltonicity in planar cubic graphs G having a facial 2-factor Q via (quasi) spanning trees of faces in G/Q and study the algorithmic complexity of finding such (quasi) spanning trees of faces. Moreover, we show that if Barnette's Conjecture is false, then hamiltonicity in 3-connected planar cubic bipartite graphs is an NP-complete problem.