1. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
2. G.J. Fisher and O. Wing, "Computer Recognition and Extraction of Planar Graphs from the Incidence Matrix", IEEE Trans. on Circuit Theory, Vol. CT-13, No. 2, 154–163 (June 1966).
3. K. Pasedach, "Criterion and Algorithms for Determination of Bipartite Subgraphs and their Application to Planarization of Graphs", in Graphen-Sprachen und Algorithmen auf Graphen, Carl Hanser Verlag, 1976, pp. 175–183.
4. M. Marek-Sadowska, "Planarization Algorithm for Integrated Circuits Engineering", Proc. 1978 IEEE International Symposium on Circuits and Systems, pp. 919–923.
5. T. Chiba, I. Nishioka, and I. Shirakawa, "An Algorithm of Maximal Planarization of Graphs", Proc. 1979 IEEE International Symposium on Circuits and Systems, pp. 649–652.