Edge-disjoint Steiner trees and connectors in graphs (Q2701394): Difference between revisions

@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-connectivity and edge-disjoint spanning trees
+Normal rank
@@ Property / cites work @@
+Packing Steiner trees
@@ Property / cites work: Packing Steiner trees / rank @@
+Normal rank
@@ Property / cites work @@
+On decomposing a hypergraph into \(k\) connected sub-hypergraphs
+Normal rank
@@ Property / cites work @@
+Connectivity and edge-disjoint spanning trees
@@ Property / cites work: Connectivity and edge-disjoint spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-disjoint trees containing some given vertices in a graph
+Normal rank
@@ Property / cites work @@
+Edge disjoint Steiner trees in graphs without large bridges
+Normal rank
@@ Property / cites work @@
+Packing Steiner trees on four terminals
@@ Property / cites work: Packing Steiner trees on four terminals / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds of the number of disjoint spanning trees
@@ Property / cites work: Bounds of the number of disjoint spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+An approximate max-Steiner-tree-packing min-Steiner-cut theorem
+Normal rank
@@ Property / cites work @@
+Steiner tree packing number and tree connectivity
@@ Property / cites work: Steiner tree packing number and tree connectivity / rank @@
+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 @@
+Packing the Steiner trees of a graph
@@ Property / cites work: Packing the Steiner trees of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank
@@ Property / cites work @@
+Packing of Steiner trees and \(S\)-connectors in graphs
+Normal rank