Planarization and fragmentability of some classes of graphs

@article{Edwards2008PlanarizationAF,
  title={Planarization and fragmentability of some classes of graphs},
  author={Keith Edwards and Graham Farr},
  journal={Discrete Mathematics},
  year={2008},
  volume={308},
  pages={2396-2406}
}
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. We have previously given bounds on this parameter for the class of graphs satisfying a given constant bound on maximum degree. In this paper, we give fragmentability bounds for some classes of graphs of bounded average degree, as well as classes of given thickness, the class of k-colourable graphs, and… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Ossona de Mendez , A characterization of DFS cotree critical graphs

H. de Fraysseix, P.
Problems from the eighteenth British Combinatorial Conference , Discrete Math . • 2003

Fragmentability of Graphs

J. Comb. Theory, Ser. B • 2001
View 4 Excerpts

Planarizing Graphs - A Survey and Annotated Bibliography

J. Graph Algorithms Appl. • 2001
View 1 Excerpt

Graph Decomposition of Slim Graphs

Graphs and Combinatorics • 1999
View 2 Excerpts

Biplanar graphs: a survey

L. W. Beineke
Comput. Math. Appl. 34 (11) • 1997

New upper bounds on harmonious colorings

Journal of Graph Theory • 1994
View 4 Excerpts

Similar Papers

Loading similar papers…