k‐shredders in k‐connected graphs
Yoshimi Egawa · Journal of Graph Theory · 2008
Abstract For a graph G, a subset S of V(G) is called a shredder if G − S consists of three or more components. We show that if k ≥ 4 and G is a k‐connected graph, then the number of shredders of cardinality k of G is less than 2|V(G)|/3 (we show a better bound for k = 4). © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 239–259, 2008