Minimally 3-restricted edge connected graphs
From MaRDI portal
(Redirected from Publication:1028461)
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
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 5064073 (Why is no real title available?)
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- A sufficient condition for the equality between the restricted edge-connectivity and the minimum edge-degree of graphs
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Edge cuts leaving components of order at least \(m\)
- Edge-cuts leaving components of order at least three
- Extraconnectivity of graphs with large girth
- Graph theory
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- On a kind of restricted edge connectivity of graphs
- On computing a conditional edge-connectivity of a graph
- On restricted edge-connectivity of graphs.
- Optimally super-edge-connected transitive graphs
- Sufficient conditions for a graph to be \(\lambda_k\)-optimal with given girth and diameter
- Sufficient conditions for λ′‐optimality in graphs with girth g
- Super-edge-connectivity properties of graphs with diameter 2
Cited in
(15)- Minimum 3-geodetically connected graphs
- scientific article; zbMATH DE number 7310216 (Why is no real title available?)
- On optimally-\(\lambda^{(3)}\) transitive graphs
- On a kind of reliability analysis of networks
- Characterization of \(\lambda_{3,q}\)-connected graphs
- scientific article; zbMATH DE number 733800 (Why is no real title available?)
- Minimum number of vertices of almost 3-regular graphs with given deficiency
- 3-restricted connectivity of graphs with given girth
- Edge-reconstruction of minimally 3-connected planar graphs
- Minimally restricted edge connected graphs
- On maximal 3-restricted edge connectivity of regular graphs
- 3-restricted edge cut of graphs
- On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks
- scientific article; zbMATH DE number 4154474 (Why is no real title available?)
- 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)
