Edge disjoint Steiner trees in graphs without large bridges (Q3652550): Difference between revisions

@@ Property / cites work @@
+On decomposing a hypergraph into \(k\) connected sub-hypergraphs
+Normal rank
@@ Property / cites work @@
+Q4471308
@@ Property / cites work: Q4471308 / rank @@
+Normal rank
@@ Property / cites work @@
+On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks
+Normal rank
@@ Property / cites work @@
+Edge-disjoint trees containing some given vertices in a graph
+Normal rank
@@ Property / cites work @@
+An approximate max-Steiner-tree-packing min-Steiner-cut theorem
+Normal rank
@@ Property / cites work @@
+Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
+Normal rank
@@ Property / cites work @@
+Eine Reduktionsmethode für den Kantenzusammenhang in Graphen
+Normal rank
@@ Property / cites work @@
+Zur Struktur minimal n-fach zusammenhängender Graphen
+Normal rank
@@ Property / cites work @@
+A Reduction Method for Edge-Connectivity in Graphs
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank