Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs
From MaRDI portal
Publication:1043973
DOI10.1016/j.disc.2009.02.006zbMath1239.05109MaRDI QIDQ1043973
Qinghai Liu, Zhao Zhang, Yanmei Hong
Publication date: 10 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.02.006
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph
- Minimally restricted edge connected graphs
- On computing a conditional edge-connectivity of a graph
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Optimally super-edge-connected transitive graphs
- Sufficient conditions for restricted-edge-connectivity to be optimal
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- Sufficient conditions for λ′‐optimality in graphs with girth g
- On restricted edge-connectivity of graphs.