Minimally 3-restricted edge connected graphs
From MaRDI portal
Publication:1028461
DOI10.1016/J.DAM.2008.07.009zbMATH Open1173.05337OpenAlexW2026570125MaRDI QIDQ1028461FDOQ1028461
Authors: Qinghai Liu, Yanmei Hong, Zhao Zhang 
Publication date: 30 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.07.009
Recommendations
- Minimally 3-connected graphs
- Minimally restricted edge connected graphs
- A note on minimally 3-connected graphs
- Sufficient conditions for graphs to be maximally 3-restricted edge connected
- Minimally 3-connected graphs with exactly \(k\) non-essential edges
- On maximal 3-restricted edge connectivity of regular graphs
- 3-restricted connectivity of graphs with given girth
- scientific article; zbMATH DE number 2197917
- Properly 3-contractible edges in a minimally 3-connected graph
- The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree
Cites Work
- Graph theory
- Extraconnectivity of graphs with large girth
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- On computing a conditional edge-connectivity of a graph
- Optimally super-edge-connected transitive graphs
- 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
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Edge cuts leaving components of order at least \(m\)
- A sufficient condition for the equality between the restricted edge-connectivity and the minimum edge-degree of graphs
- Title not available (Why is that?)
- Sufficient conditions for λ′‐optimality in graphs with girth g
- On restricted edge-connectivity of graphs.
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Title not available (Why is that?)
- Sufficient conditions for a graph to be \(\lambda_k\)-optimal with given girth and diameter
- Super-edge-connectivity properties of graphs with diameter 2
Cited In (15)
- On maximal 3-restricted edge connectivity of regular graphs
- On a kind of reliability analysis of networks
- 3-restricted edge cut of graphs
- Title not available (Why is that?)
- Minimum 3-geodetically connected graphs
- On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks
- Title not available (Why is that?)
- Edge-reconstruction of minimally 3-connected planar graphs
- Characterization of \(\lambda_{3,q}\)-connected graphs
- 3-restricted connectivity of graphs with given girth
- On optimally-\(\lambda^{(3)}\) transitive graphs
- Title not available (Why is that?)
- Minimally restricted edge connected graphs
- Minimum number of vertices of almost 3-regular graphs with given deficiency
- On the 3-restricted edge connectivity of permutation graphs
This page was built for publication: Minimally 3-restricted edge connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028461)
