Behrooz Bagheri Gh.

dblp:120/1395 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2022 On Finding Hamiltonian Cycles in Barnette Graphs
abstract
In this paper we deal with hamiltonicity in planar cubic graphs G having a facial 2–factor 𝒬 via (quasi) spanning trees of faces in G/𝒬 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.
Behrooz Bagheri Gh., Tomás Feder, Herbert Fleischner, Carlos S. Subi
Fundam. Informaticae1