Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs

Keith Edwards, Graham Farr

Abstract


We study the number of vertices which must be removed from a graph in order to make it planar or series-parallel. We give improved upper bounds on the number of vertices required to planarize graphs of bounded average degree $d$, and for small $d$ also an improved bound for series-parallelization.

The coefficient of fragmentability of a class of graphs measures the proportion of vertices that need to be removed from the graphs in the class in order to leave behind bounded sized components. The above bounds on planarization yield improved bounds for the coefficient of fragmentability of the class of connected graphs of average degree at most $d$.

As an application we give an improved bound on the size of regular expressions representing deterministic finite automata.

Keywords


Fragmentability; Planarization; Series-parallel; Tree width; Regular expression

Full Text: PDF