Recent techniques and results on the Erdős–Pósa property

Graph minors. V. Excluding a planar graph

Neil Robertson, Paul Seymour · Journal of Combinatorial Theory Series B · 1986 · 756 citations

Computing, Computer Science, Combinatorics +8

Quickly Excluding a Planar Graph

Neil Robertson, Paul Seymour, Rajan M. Thomas · Journal of Combinatorial Theory Series B · 1994 · 459 citations

Computing, Computer Science, Computational Geometry +5

Directed Tree-Width

Thor Johnson, Neil Robertson, Paul Seymour et al. · Journal of Combinatorial Theory Series B · 2001 · 274 citations

On Independent Circuits Contained in a Graph

P. Erdös, L. Pósa · Canadian Journal of Mathematics · 1965 · 250 citations · Full text

Natural Sciences, Computer Science, Mathematics +7

A Minimax Theorem for Directed Graphs

Cláudio L. Lucchesi, D. H. Younger · Journal of the London Mathematical Society · 1978 · 243 citations

Computing, Computer Science, Mathematics +11