Planarizing Graphs - A Survey and Annotated Bibliography Vol. 5, no. 1, pp. 1-74, 2001. Regular paper. Abstract Given a finite, undirected, simple graph $G$, we are concerned with operations on $G$ that transform it into a planar graph. We give a survey of results about such operations and related graph parameters. While there are many algorithmic results about planarization through edge deletion, the results about vertex splitting, thickness, and crossing number are mostly of a structural nature. We also include a brief section on vertex deletion. We do not consider parallel algorithms, nor do we deal with on-line algorithms. Submitted: June 1996. Revised: December 1998. Revised: January 2001. Communicated by Alan Gibbons article (PDF) BibTeX