On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks

DOI10.1016/S0166-218X(02)00465-1zbMath1030.90128OpenAlexW2083365145MaRDI QIDQ1410692

Tibor Jordán

Publication date: 14 October 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00465-1

zbMATH Keywords

Steiner networksSteiner ratioEdge-connectivity of graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

The Steiner Problem for Count Matroids ⋮ Edge disjoint Steiner trees in graphs without large bridges

Cites Work

• Unnamed Item
• Minimum-weight two-connected spanning networks
• A proof of the Gilbert-Pollak conjecture on the Steiner ratio
• Über n-fach zusammenhängende Eckenmengen in Graphen
• On minimum-weight \(k\)-edge connected Steiner networks on metric spaces
• On shortest \(k\)-edge-connected Steiner networks in metric spaces
• Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
• A Reduction Method for Edge-Connectivity in Graphs
• Maximum matching and a polyhedron with 0,1-vertices