1. S. Bühler, Planarity of Graphs, M.Sc. dissertation, University of Dundee, 2000.
2. J. Cai and X. Han and R. E. Tarjan, An O(mlog n)-Time Algorithm for the Maximal Planar Subgraph Problem, SIAM J. Comput. 22 (1993) 1142–1162.
3. G. Călinescu, C. G. Fernandes, U. Finkler and H. Karloff, A better approximation algorithm for finding planar subgraphs, in: Proc. 7th Ann. ACM-SIAM Symp. on Discrete Algorithms (Atlanta, GA, 1996); also: J. Algorithms 27 (1998) 269–302.
4. Robert Cimikowski, An analysis of some heuristics for the maximum planar subgraph problem, in: Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms (San Francisco, CA, 1995), pp 322–331, ACM, New York, 1995.
5. G. Di Battista, Peter Eades, Roberto Tamassia and I. Tollis, Graph Drawing:A lgorithms for the Visualization of Graphs, Prentice Hall, 1999.