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 coeffcient 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 coeffcient 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.
| Original language | English |
|---|---|
| Article number | P25 |
| Number of pages | 19 |
| Journal | Electronic Journal of Combinatorics |
| Volume | 19 |
| Issue number | 2 |
| Publication status | Published - 31 May 2012 |