5-Shredders of Contraction-Critical 5-Connected Graphs
From MaRDI portal
Publication:5087061
DOI10.1142/S0129626420400083zbMath1491.05116MaRDI QIDQ5087061
Publication date: 8 July 2022
Published in: Parallel Processing Letters (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some structural properties of minimally contraction-critically 5-connected graphs
- Some properties of contraction-critical 5-connected graphs
- 5-shredders in 5-connected graphs
- Generalizaions of critical connectivity of graphs
- A survey on contractible edges in graphs of a prescribed vertex connectivity
- Small components of the 5-subgraph of a contraction-critically 5-connected graph
- A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
- A recursive characterization of the 4-connected graphs
- Finding a Smallest Augmentation to Biconnect a Graph
- The Existence and Construction of Balanced Incomplete Block Designs
- k-shredders ink-connected graphs
- On the number of shredders
- Triangle Density and Contractibility
- A Balanced Incomplete Block Design
- Average degree and contractibility
This page was built for publication: 5-Shredders of Contraction-Critical 5-Connected Graphs