A new planarity test based on 3-connectivity
John L. Bruno, Ken Steiglitz, Louis Weinberg · IEEE Transactions on Circuit Theory · 1970
In this paper we give a new algorithm for determining if a graph is planar. The algorithm is based on Tutte's theory of 3-connected graphs, and provides a structural decomposition of the graph. Results are presented in the algorithmic form, and a computer program is described.