Tight Bounds for Linkages in Planar Graphs (Q3012796): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-22006-7_10
+Normal rank
@@ Property / OpenAlex ID @@
+W167453680
@@ Property / OpenAlex ID: W167453680 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Disjoint-Paths Completion
@@ Property / cites work: Planar Disjoint-Paths Completion / rank @@
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+Domination Problems in Nowhere-Dense Classes
@@ Property / cites work: Domination Problems in Nowhere-Dense Classes / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the pathwidth of some grid-like graphs
+Normal rank
@@ Property / cites work @@
+Induced Packing of Odd Cycles in a Planar Graph
@@ Property / cites work: Induced Packing of Odd Cycles in a Planar Graph / rank @@
+Normal rank
@@ Property / cites work @@
+The Induced Disjoint Paths Problem
@@ Property / cites work: The Induced Disjoint Paths Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Odd cycle packing
@@ Property / cites work: Odd cycle packing / rank @@
+Normal rank
@@ Property / cites work @@
+A shorter proof of the graph minor algorithm
@@ Property / cites work: A shorter proof of the graph minor algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365079
@@ Property / cites work: Q5365079 / rank @@
+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 @@
+Q4273851
@@ Property / cites work: Q4273851 / 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 minors. XXI. graphs with unique linkages
@@ Property / cites work: Graph minors. XXI. graphs with unique linkages / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XXII. Irrelevant vertices in linkage problems
+Normal rank
@@ Property / cites work @@
+Finding <i>k</i> Disjoint Paths in a Directed Planar Graph
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+NP-completeness of some edge-disjoint paths problems
+Normal rank