k-shredders ink-connected graphs

DOI10.1002/JGT.20336MaRDI QIDQ3605152zbMATHOpenAlexFDO

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

zbMATH Keywords

graphconnectivityupper boundshredder

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 5304947
• 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

Cites work

• scientific article; zbMATH DE number 1256717 (Why is no real title available?)
• On the number of shredders

Cited in

(13)

• 7-shredders in 7-connected graphs
• scientific article; zbMATH DE number 5304947 (Why is no real title available?)
• scientific article; zbMATH DE number 2113498 (Why is no real title available?)
• On \((t,k)\)-shredders in \(k\)-connected graphs.
• The firebreak problem
• 10-shredders in 10-connected graphs
• scientific article; zbMATH DE number 1256717 (Why is no real title available?)
• 5-shredders of contraction-critical 5-connected graphs
• Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
• 9-shredders in 9-connected graphs
• 8-shredders in 8-connected graphs
• 5-shredders in 5-connected graphs
• On shredders and vertex 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)