M. R. Garey, D. S. Johnson, and R. E. Tarjan, The Planar Hamiltonian Circuit Problem is NP-Complete, SIAM Journal on Computing, vol.5, issue.4, pp.704-714, 1976.
DOI : 10.1137/0205049

B. Plestenjak, An algorithm for drawing planar graphs. Software-Practice and Experience, pp.973-984, 1999.