The Hopcroft-Tarjan Planarity Algorithm
William Lawrence Kocay · 1993
This is an expository article on the Hopcroft-Tarjan planarity algorithm. A graph-theoretic analysis of a version of the algorithm is presented. An explicit formula is given for determining which vertex to place first in the adjacency list of any vertex. The intention is to make the Hopcroft-Tarjan algorithm more accessible and intuitive than it currently is.