Planarizing Graphs - A Survey and Annotated Bibliography


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… (More)

13 Figures and Tables


  • Presentations referencing similar topics