A subset S of k vertices in a k-connected graph G is a shredder, if G - S has at least three components. We show that if G has n vertices, then the number of shredders is at most n, which was conjectured by Cheriyan and Thurimella [Cheriyan & Thurimella, Proc 28th Ann ACM Symp, 1996]. If G contains no meshing shredders (in particular, if k ≤ 3), the sharp upper bound [(n - k - 1)/2] is proven.
|Number of pages||6|
|Journal||Journal of Graph Theory|
|Publication status||Published - Jul 1999|
- Minimum cuts
- k-connected graphs
ASJC Scopus subject areas
- Geometry and Topology