On finding hamiltonian cycles in Barnette graphs

On finding hamiltonian cycles in Barnette graphs

Fundamenta Informaticae, Volume 188, Issue 1 (December 15, 2022) fi:10437 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. Mor...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Gh, Behrooz Bagheri, Feder, Tomas, Fleischner, Herbert, Subi, Carlos
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Fundamenta Informaticae, Volume 188, Issue 1 (December 15, 2022) fi:10437 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.
DOI:10.48550/arxiv.2212.02668