On local connectivity of K₂,p-free graphs
From MaRDI portal
Publication:3099530
Recommendations
- On the connectivity of \(p\)-diamond-free graphs
- Maximal local edge-connectivity of diamond-free graphs
- On local connectivity of graphs with given clique number
- On local connectivity of graphs
- Connectivity in graphs and digraphs. Maximizing vertex-, edge- and arc-connectivity with an emphasis on local connectivity properties
Cited in
(6)- On the connectivity of \(p\)-diamond-free graphs
- On local connectivity of graphs
- Maximal local edge-connectivity of diamond-free graphs
- scientific article; zbMATH DE number 1136719 (Why is no real title available?)
- On local connectivity of graphs with given clique number
- On locally \(k\)-critically \(n\)-connected graphs
This page was built for publication: On local connectivity of \(K_{2,p}\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3099530)
