Back to Search
Start Over
5-Shredders in 5-connected graphs
- Source :
-
Discrete Mathematics . Apr2009, Vol. 309 Issue 6, p1565-1574. 10p. - Publication Year :
- 2009
-
Abstract
- Abstract: For a graph , a subset of is called a shredder if consists of three or more components. We show that if is a 5-connected graph with , then the number of shredders of cardinality 5 of is less than or equal to . [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 309
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 37161322
- Full Text :
- https://doi.org/10.1016/j.disc.2008.02.028