Planarization and fragmentability of some classes of graphs (Q2427499)

A graph \(G\) is \((C,\varepsilon)\)-fragmentable if there exists a \(X \subset V(G)\) such that \(|X|\leq \varepsilon|V(G)|\) and every component of \(G-X\) has at most \(C\) vertices. A class \(\Gamma\) of graphs is \(\varepsilon\)-fragmentable if there exists a \(C\) such that every \(G \in \Gamma\) is \((C,\varepsilon)\)-fragmentable. The coefficient of fragmentability of \(\Gamma\) is \(c_f (\Gamma)= \inf\{ \varepsilon\mid \Gamma\text{ is }\varepsilon\)-fragmentable