\(k\)-restricted edge-connectivity in triangle-free graphs
From MaRDI portal
Publication:423966
DOI10.1016/j.dam.2012.01.022zbMath1243.05131OpenAlexW2017158794MaRDI QIDQ423966
Dirk Meierling, Andreas Holtkamp, Luis Pedro Montejano
Publication date: 30 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.01.022
Related Items (9)
Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth ⋮ Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected ⋮ Unnamed Item ⋮ Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected ⋮ \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs ⋮ On the complexity of computing the \(k\)-restricted edge-connectivity of a graph ⋮ The \(p\)-restricted edge-connectivity of Kneser graphs ⋮ 4-factor-criticality of vertex-transitive graphs ⋮ On the Complexity of Computing the k-restricted Edge-connectivity of a Graph
Cites Work
- Unnamed Item
- Unnamed Item
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Edge fault tolerance analysis of super \(k\)-restricted connected networks
- Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
- On computing a conditional edge-connectivity of a graph
- On a kind of restricted edge connectivity of graphs
- Edge-cuts leaving components of order at least three
- On the extraconnectivity of graphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Conditional connectivity
- On Representatives of Subsets
This page was built for publication: \(k\)-restricted edge-connectivity in triangle-free graphs
