On local connectivity of graphs
From MaRDI portal
Publication:2472822
DOI10.1016/j.aml.2006.12.014zbMath1134.05046MaRDI QIDQ2472822
Publication date: 25 February 2008
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2006.12.014
05C40: Connectivity
Related Items
On local connectivity of graphs with given clique number, Fault-tolerant strong Menger connectivity of modified bubble-sort graphs, Maximally edge-connected and vertex-connected graphs and digraphs: A survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds on the vertex-connectivity of digraphs and graphs
- Sufficient conditions for maximally connected dense graphs
- Connectivity of large bipartite digraphs and graphs
- Bipartite graphs and digraphs with maximum connectivity
- Lower-bounds on the connectivities of a graph
- A Lower Bound on the Number of Vertices of a Graph
- Maximally connected digraphs
- Sufficient conditions for equality of connectivity and minimum degree of a graph
- The connectivity of large digraphs and graphs
- A Lower Bound for the Number of Vertices of a Graph