On the algorithmic complexity of finding hamiltonian cycles in special classes of planar cubic graphs
From MaRDI portal
Publication:6303161
arXiv1806.06713MaRDI QIDQ6303161
Carlos Subi, Herbert Fleischner, Tomás Feder, Behrooz Bagheri Gh.
Publication date: 15 June 2018
This page was built for publication: On the algorithmic complexity of finding hamiltonian cycles in special classes of planar cubic graphs