On locally k-critically n-connected graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3885951
- On \(k\)-con-critically \(n\)-connected graphs
- On local connectivity of \(K_{2,p}\)-free graphs
- scientific article; zbMATH DE number 68915
- Critically (k,k)-connected graphs
- On connected \((\gamma,k)\)-critical graphs
- On local connectivity of graphs
- Locally \(C^ k_ n\) graphs
- scientific article; zbMATH DE number 894705
- On local edge connected domination critical graphs
Cites work
- scientific article; zbMATH DE number 3885951 (Why is no real title available?)
- scientific article; zbMATH DE number 4101236 (Why is no real title available?)
- scientific article; zbMATH DE number 568837 (Why is no real title available?)
- A Note on k-Critically n-Connected Graphs
- Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
- Fragments in 2-critically n-connected graphs
- On k-critical, n-connected graphs
Cited in
(10)- scientific article; zbMATH DE number 1136719 (Why is no real title available?)
- A note on fragments in a locally \(k\)-critical \(n\)-connected graph.
- On k-critical connected line graphs
- On the existence of (k,l)-critical graphs
- A local structure theorem on 5-connected graphs
- The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)
- Removable edges in a 5-connected graph and a construction method of 5-connected graphs
- Lower bounds for locally highly connected graphs
- High connectivity keeping sets in graphs and digraphs
- The symmetric (2k, k)-graphs
This page was built for publication: On locally \(k\)-critically \(n\)-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687120)
