Title :
A new planarity test based on 3-connectivity
Author :
Bruno, John ; Steiglitz, Kenneth ; Weinberg, Louis
fDate :
5/1/1970 12:00:00 AM
Abstract :
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.
Keywords :
Computer-aided analysis; Graph theory; Network topology; Planar graphs; Circuit testing; Circuit theory; Communication networks; Communication systems; Communications technology; Costs; Network synthesis; Programming;
Journal_Title :
Circuit Theory, IEEE Transactions on
DOI :
10.1109/TCT.1970.1083101
