k-shredders ink-connected graphs

DOI10.1002/JGT.20336zbMATH Open1184.05075OpenAlexW2322731563MaRDI QIDQ3605152FDOQ3605152

Authors: Yoshimi Egawa 

Publication date: 20 February 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20336

Recommendations

• scientific article
• On \((t,k)\)-shredders in \(k\)-connected graphs.
• 10-shredders in 10-connected graphs
• 9-shredders in 9-connected graphs
• 5-shredders in 5-connected graphs

zbMATH Keywords

graphconnectivityupper boundshredder

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• On the number of shredders
• Title not available (Why is that?)

Cited In (12)

• 5-Shredders of Contraction-Critical 5-Connected Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On shredders and vertex connectivity augmentation
• 8-shredders in 8-connected graphs
• 5-shredders in 5-connected graphs
• The firebreak problem
• On \((t,k)\)-shredders in \(k\)-connected graphs.
• 9-shredders in 9-connected graphs
• Title not available (Why is that?)
• 7-shredders in 7-connected graphs
• Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation

This page was built for publication: k-shredders ink-connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605152)