Graph minors. VI. Disjoint paths across a disc
From MaRDI portal
Publication:1079580
DOI10.1016/0095-8956(86)90031-6zbMath0598.05042MaRDI QIDQ1079580
Publication date: 1986
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(86)90031-6
68Q25: Analysis of algorithms and problem complexity
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
On completeness for NP via projection translations, Representations of graphs and networks (coding, layouts and embeddings), Disjoint homotopic paths and trees in a planar graph, Directed circuits on a torus, On obstructions to small face covers in planar graphs, General vertex disjoint paths in series-parallel graphs, A partial k-arboretum of graphs with bounded treewidth, Minimal acyclic forbidden minors for the family of graphs with bounded path-width, Improved self-reduction algorithms for graphs with bounded treewidth, Rooted routing in the plane, Subdivisions in planar graphs, The disjoint shortest paths problem