@inbook{cd1756c06780481d99ad50c95c328f9f,

title = "Graph fragmentability",

abstract = "Fragmentability concerns the extent to which a graph can be broken up into small (bounded sized) components by removing as few vertices as possible. To make this concept precise, we define the coefficient of fragmentability of a class of graphs, and summarize the known upper and lower bounds for this parameter, for various graph classes. We discuss the relationship of fragmentability to the planarization of graphs (by removing vertices), and to colourings with small monochromatic components. We also mention a number of open problems and potential applications of fragmentability.",

author = "Keith Edwards and Graham Farr",

year = "2012",

language = "English",

isbn = "978051802314",

series = "Encyclopedia of Mathematics and Its Applications",

publisher = "Cambridge University Press",

pages = "203--218",

editor = "Beineke, {Lowell W.} and Wilson, {Robin J.}",

booktitle = "Topics in Structural Graph Theory",

address = "United Kingdom",

}