Sufficient conditions for triangle-free graphs to be super k-restricted edge-connected
From MaRDI portal
Publication:894466
DOI10.1016/J.IPL.2015.09.005zbMATH Open1346.68149OpenAlexW1515033817MaRDI QIDQ894466FDOQ894466
Publication date: 1 December 2015
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2015.09.005
Recommendations
- Super 3-restricted edge connectivity of triangle-free graphs.
- Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
- A sufficient condition for graphs to be super \(k\)-restricted edge connected
- Sufficient conditions for triangle-free graphs to be super-\(\lambda'\)
- Sufficient conditions for graphs to be super restricted edge connected
Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Extraconnectivity of graphs with large girth
- Graph theory with applications
- On computing a conditional edge-connectivity of a graph
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- Edge-cuts leaving components of order at least three
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Edge cuts leaving components of order at least \(m\)
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
- On super-edge-connected digraphs and bipartite digraphs
- Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
- \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs
- Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
- Size in maximal triangle-free graphs and minimal graphs of diameter 2
- Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
Cited In (5)
- Sufficient conditions for bipartite graphs to be super restricted edge-connected
- Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
- Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
- Arc fault tolerance of Kautz digraphs
- Super 3-restricted edge connectivity of triangle-free graphs.
This page was built for publication: Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894466)
