On finding hamiltonian cycles in Barnette graphs
Combinatorics
2023-06-22 v2
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.
Cite
@article{arxiv.2212.02668,
title = {On finding hamiltonian cycles in Barnette graphs},
author = {Behrooz Bagheri Gh. and Tomas Feder and Herbert Fleischner and Carlos Subi},
journal= {arXiv preprint arXiv:2212.02668},
year = {2023}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1806.06713