Liebers, Annegret Planarizing graphs—a survey and annotated bibliography. (English) Zbl 0966.05022 J. Graph Algorithms Appl. 5, No. 1, 74 p. (2001). Summary: 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. Cited in 25 Documents MSC: 05C10 Planar graphs; geometric and topological aspects of graph theory 01A70 Biographies, obituaries, personalia, bibliographies Keywords:simple graph; planar graph; graph parameters; planarization; vertex splitting; thickness; crossing number; vertex deletion; algorithms PDFBibTeX XMLCite \textit{A. Liebers}, J. Graph Algorithms Appl. 5, No. 1, 74 p. (2001; Zbl 0966.05022) Full Text: DOI EuDML