Publication:4273851

zbMath0791.05092MaRDI QIDQ4273851

Neil Robertson, Alexander Schrijver, Bruce A. Reed, P. D. Seymour

Publication date: 13 January 1994

zbMATH Keywords

NP-complete; planar graph; linear-time algorithm; disjoint trees problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C05: Trees

68R10: Graph theory (including graph drawing) in computer science

05C38: Paths and cycles

05C10: Planar graphs; geometric and topological aspects of graph theory

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Rooted routing in the plane