On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks (Q1410692): Difference between revisions

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