An algorithm for finding Hamiltonian Cycles in Cubic Planar Graphs

Bohao Yao, Charl Ras, Hamid Mokhtar

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 informa…