Packing of Steiner trees and \(S\)-connectors in graphs (Q765198): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jctb.2011.06.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2127250537
@@ Property / OpenAlex ID: W2127250537 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5593828
@@ Property / cites work: Q5593828 / rank @@
+Normal rank
@@ Property / cites work @@
+On decomposing a hypergraph into \(k\) connected sub-hypergraphs
+Normal rank
@@ Property / cites work @@
+On the degrees of the vertices of a directed graph
+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 @@
+An approximate max-Steiner-tree-packing min-Steiner-cut theorem
+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