3-restricted connectivity of graphs with given girth
From MaRDI portal
Publication:1032795
DOI10.1007/S11766-008-1908-ZzbMath1199.05192OpenAlexW2061297630MaRDI QIDQ1032795
Publication date: 11 November 2009
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-008-1908-z
Cites Work
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- On the restricted connectivity and superconnectivity in graphs with given girth
- On computing a conditional edge-connectivity of a graph
- Extraconnectivity of graphs with large girth
- On a kind of restricted edge connectivity of graphs
- Edge-cuts leaving components of order at least three
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Edge cuts leaving components of order at least \(m\)
- Sufficient conditions for λ′‐optimality in graphs with girth g
- On restricted edge-connectivity of graphs.
This page was built for publication: 3-restricted connectivity of graphs with given girth
