Title of article
5-Shredders in 5-connected graphs
Author/Authors
Egawa، نويسنده , , Yoshimi and Okadome، نويسنده , , Yumiko and Takatou، نويسنده , , Masanori، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
10
From page
1565
To page
1574
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 G is a 5-connected graph with | V ( G ) | ≥ 135 , then the number of shredders of cardinality 5 of G is less than or equal to ( 2 | V ( G ) | − 10 ) / 3 .
Keywords
connectivity , Shredder , Upper bound , graph
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598619
Link To Document