Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth

Recommendations

Sufficient conditions for graphs to be super restricted edge connected
Sufficient conditions for a graph to be super restricted edge-connected
A sufficient condition for graphs to be super \(k\)-restricted edge connected
Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
Sufficient conditions for a graph to be super 3-restricted connected with given girth
Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected
On the restricted connectivity and superconnectivity in graphs with given girth
Degree conditions for graphs to be maximally k-restricted edge connected and super k-restricted edge connected
Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected

Cites work

k-restricted edge connectivity in (p+1)-clique-free graphs
\(k\)-restricted edge-connectivity in triangle-free graphs
A bound on 4-restricted edge connectivity of graphs
A general sufficient condition for a graph \(G\) with \(\lambda _{m }(G) \leqslant \zeta _{m }(G)\)
A Graph-Theoretic Approach to a Communications Problem
A proof of an inequality concerning \(k\)-restricted edge connectivity
A sufficient condition for graphs to be super \(k\)-restricted edge connected
Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
Edge cuts leaving components of order at least \(m\)
Edge-cuts leaving components of order at least three
Graph theory with applications
scientific article; zbMATH DE number 1332751 (Why is no real title available?)
scientific article; zbMATH DE number 1062587 (Why is no real title available?)
scientific article; zbMATH DE number 3041944 (Why is no real title available?)
Maximally connected digraphs
On computing a conditional edge-connectivity of a graph
On graphs with equal edge connectivity and minimum degree
On graphs with equal edge-connectivity and minimum degree
On maximal 3-restricted edge connectivity of regular graphs
On restricted edge-connectivity of graphs.
On the extraconnectivity of graphs
Optimally super-edge-connected transitive graphs
Results on the edge-connectivity of graphs
Sufficient conditions for k-restricted edge connected graphs
Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
Sufficient conditions for graphs to be maximally 4-restricted edge connected
Sufficient conditions for maximally connected dense graphs
Sufficient conditions for restricted-edge-connectivity to be optimal
Super edge connectivity properties of connected edge symmetric graphs
The \(k\)-restricted edge-connectivity of a product of graphs

Cited in

(5)

Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
Bound on m-restricted edge connectivity
Sufficient conditions for bipartite graphs to be super restricted edge-connected
Minimally 4-restricted edge connected graphs
A general sufficient condition for a graph \(G\) with \(\lambda _{m }(G) \leqslant \zeta _{m }(G)\)

This page was built for publication: Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069204)