On finding hamiltonian cycles in Barnette graphs

Behrooz Bagheri Gh.,Tomas Feder,Herbert Fleischner,Carlos Subi

arxiv（2022）

引用 0|浏览19

暂无评分

摘要

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.

查看译文

关键词

Barnette's Conjecture,eulerian plane graph,hamiltonian cycle,spanning tree of faces,A-trail

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要