Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs (Q1861573): Difference between revisions

@@ Property / cites work @@
+Q4871749
@@ Property / cites work: Q4871749 / rank @@
+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 Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank