A simple solution to the two paths problem in planar graphs
From MaRDI portal
Publication:917331
DOI10.1016/0020-0190(90)90071-5zbMath0704.68091OpenAlexW2010031222MaRDI QIDQ917331
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(90)90071-5
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Rooted \(K_4\)-minors ⋮ A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs ⋮ Improved Algorithms for the 2-Vertex Disjoint Paths Problem
Cites Work
This page was built for publication: A simple solution to the two paths problem in planar graphs