Bohao Yao, Charl Ras, Hamid Mokhtar
Published 2015-12-04Version 1
We first prove a one-to-one correspondence between finding Hamiltonian cycles in a cubic planar graphs and finding trees with specific properties in dual graphs. Using this information, we construct an exact algorithm for finding Hamiltonian cycles in cubic planar graphs. The worst case time complexity of our algorithm is O$(2^n)$.
On finding hamiltonian cycles in Barnette graphs
Generalized de Bruijn words for Primitive words and Powers
On the degree sequences of dual graphs on surfaces
![QR code for arXiv:1512.01324 [math.CO]](http://oss.arxitics.com/images/favicon.svg)