On the number of shredders

Research output: Contribution to journalArticle

14 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)195-200
Number of pages6
JournalJournal of Graph Theory
Issue number3
Publication statusPublished - Jul 1999


  • Connectivity
  • Minimum cuts
  • k-connected graphs

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint Dive into the research topics of 'On the number of shredders'. Together they form a unique fingerprint.

  • Cite this