Lower-bounds on the connectivities of a graph
From MaRDI portal
Publication:3815344
DOI10.1002/JGT.3190090411zbMATH Open0664.05050OpenAlexW1973102168MaRDI QIDQ3815344FDOQ3815344
Authors: Abdol-Hossein Esfahanian 
Publication date: 1985
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190090411
Recommendations
Extremal problems in graph theory (05C35) Connectivity (05C40) Structural characterization of families of graphs (05C75)
Cited In (24)
- Title not available (Why is that?)
- Lower bounds for the algebraic connectivity of graphs with specified subgraphs
- Edge-connectivity in hypergraphs
- Title not available (Why is that?)
- On local connectivity of graphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Bounds on the average connectivity of a graph
- Lower bounds of connectedness probability for some classes of random graphs
- Sufficient conditions for maximally connected dense graphs
- The superconnectivity of large digraphs and graphs
- Title not available (Why is that?)
- Super edge-connectivity of dense digraphs and graphs
- Lower bounds on the differential of a graph
- The connectivity and minimum degree of circuit graphs of matroids
- On the connectivity of \(p\)-diamond-free graphs
- Superconnectivity of bipartite digraphs and graphs
- Lower connectivities of regular graphs with small diameter
- Lower bounds on the vertex-connectivity of digraphs and graphs
- Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages
- On local connectivity of graphs with given clique number
- Lower bounds for locally highly connected graphs
- Large fault-tolerant interconnection networks
- Note on the connectivity of line graphs
- A graph theoretical analysis of the number of edges in \(k\)-dense graphs
This page was built for publication: Lower-bounds on the connectivities of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3815344)
