7 citations · 11 across the 10 of their papers we have counts for
Showing 2018 · math.COShow all
2 papers · 2 filters
math.CO2018
On the algorithmic complexity of finding hamiltonian cycles in special classes of planar cubic graphs
Behrooz Bagheri Gh., Tomas Feder, Herbert Fleischner +1
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-co…
math.CO2018
Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture
Behrooz Bagheri Gh., Tomas Feder, Herbert Fleischner +1
We study the existence of hamiltonian cycles in plane cubic graphs G having a facial 2-factor Q. Thus hamiltonicity in G is transformed into the existence of a (quasi) spanning tre…