A simple solution to the two paths problem in planar graphs
type: Item
instance of: scholarly article
title: A simple solution to the two paths problem in planar graphs
zbMATH Open document ID: 0704.68091
DOI: 10.1016/0020-0190(90)90071-5
published in: Information Processing Letters
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 4155929
zbMATH Keywords: graph algorithms
zbMATH Keywords: disjoint paths
zbMATH Keywords: two paths problem
zbMATH Keywords: planar graphs
author: Gerhard J. Woeginger
MaRDI profile type: Publication
full work available at URL: 0020-0190(90)90071-5
OpenAlex ID: W2010031222
cites work: The directed subgraph homeomorphism problem
cites work: Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
cites work: A Polynomial Solution to the Undirected Two Paths Problem
description: scientific article; zbMATH DE number 4155929