Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs (Q6143971): Difference between revisions

@@ Property / cites work @@
+Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of partitioning graphs into connected subgraphs
+Normal rank
@@ Property / cites work @@
+Q3883524
@@ Property / cites work: Q3883524 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4168622
@@ Property / cites work: Q4168622 / rank @@
+Normal rank
@@ Property / cites work @@
+Fault-tolerant routings in a \(\kappa\)-connected network
+Normal rank
@@ Property / cites work @@
+New results in graph routing
@@ Property / cites work: New results in graph routing / rank @@
+Normal rank
@@ Property / cites work @@
+A homology theory for spanning tress of a graph
@@ Property / cites work: A homology theory for spanning tress of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
+Normal rank
@@ Property / cites work @@
+A linear algorithm for bipartition of biconnected graphs
+Normal rank