The hardness of routing two pairs on one face (Q662307): Difference between revisions

@@ Property / cites work @@
+Edge-disjoint paths in planar graphs
@@ Property / cites work: Edge-disjoint paths in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3972951
@@ Property / cites work: Q3972951 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the planar directed edge-disjoint paths problem
+Normal rank
@@ Property / cites work @@
+Multicommodity flows in planar graphs
@@ Property / cites work: Multicommodity flows in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity flows in graphs
@@ Property / cites work: Multicommodity flows in graphs / 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 @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank