Optimization problems of the third edge-connectivity of graphs
From MaRDI portal
Publication:862723
DOI10.1007/s11425-006-0791-4zbMath1108.05056OpenAlexW1738268414MaRDI QIDQ862723
Publication date: 24 January 2007
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-006-0791-4
Related Items (2)
Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computing a conditional edge-connectivity of a graph
- Results on the edge-connectivity of graphs
- Super restricted edge-connectivity of vertex-transitive graphs
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Upper bound on the third edge-connectivity of graphs
- Combinatorial optimization problems in the analysis and design of probabilistic networks
- On super-edge-connected digraphs and bipartite digraphs
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
This page was built for publication: Optimization problems of the third edge-connectivity of graphs
