Independent trees in graphs (Q1323489): Difference between revisions

@@ Property / cites work @@
+Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
+Normal rank
@@ Property / cites work @@
+Dividing a Graph into Triconnected Components
@@ Property / cites work: Dividing a Graph into Triconnected Components / rank @@
+Normal rank
@@ Property / cites work @@
+The multi-tree approach to reliability in distributed networks
+Normal rank
@@ Property / cites work @@
+On independent spanning trees
@@ Property / cites work: On independent spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+A Reduction Method for Edge-Connectivity in Graphs
+Normal rank
@@ Property / cites work @@
+Paths in graphs, reducing the edge-connectivity only by two
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-disjoint paths and edge-disjoint branchings in directed graphs
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01202468
+Normal rank
@@ Property / OpenAlex ID @@
+W2035780934
@@ Property / OpenAlex ID: W2035780934 / rank @@
+Normal rank