On the algorithmic complexity of finding hamiltonian cycles in special classes of planar cubic graphs

It is a well-known fact that hamiltonicity in planar cubic graphs is an NP-complete problem. This implies that the existence of an A-trail in plane eulerian graphs is also an NP-complete problem even if restricted to planar 3-connected eulerian graphs. In this paper we deal with hamiltonicity in pla...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2018-06
Hauptverfasser:	Behrooz Bagheri Gh, Feder, Tomas, Fleischner, Herbert, Subi, Carlos
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Complexity Graph theory Graphs
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!