Disjoint Paths in a Planar Graph—A General Theorem

DOI10.1137/0405009zbMath0767.05062OpenAlexW2112406764MaRDI QIDQ3989016

Guoli Ding, P. D. Seymour, Alexander Schrijver

Publication date: 28 June 1992

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0405009

zbMATH Keywords

planar graphdisjoint paths

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Multicriteria movement synchronization scheduling problems and algorithms ⋮ Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms ⋮ Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs

This page was built for publication: Disjoint Paths in a Planar Graph—A General Theorem