arXiv:1806.06713 [math.CO]AbstractReferencesReviewsResources Classifications Subjects Themes Keywords planar cubic graphs, finding hamiltonian cycles, algorithmic complexity, special classes, np-complete problem Tags Journal Information Publisher Journal Year Month Volume Number Pages DOI URL Miscellaneous Typesetting Pages Language License Submit Reset