Disjoint paths in symmetric digraphs (Q1003758): Difference between revisions

@@ Property / cites work @@
+Q4871749
@@ Property / cites work: Q4871749 / rank @@
+Normal rank
@@ Property / cites work @@
+The subgraph homeomorphism problem
@@ Property / cites work: The subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Combinatorial Problems
+Normal rank
@@ Property / cites work @@
+On the complexity of the disjoint paths problem
@@ Property / cites work: On the complexity of the disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+The edge-disjoint paths problem is NP-complete for series-parallel graphs
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+Weak Three-Linking in Eulerian Dgraphs
@@ Property / cites work: Weak Three-Linking in Eulerian Dgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+NP-completeness of some edge-disjoint paths problems
+Normal rank
@@ Property / cites work @@
+Multicommodity flows in certain planar directed networks
+Normal rank
@@ Property / cites work @@
+Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
+Normal rank
@@ Property / cites work @@
+A Polynomial Solution to the Undirected Two Paths Problem
+Normal rank