Tree-depth, subgraph coloring and homomorphism bounds

Graph minors. II. Algorithmic aspects of tree-width

Neil Robertson, Paul Seymour · Journal of Algorithms · 1986 · 1.5K citations

Mathematical Programming, Graph Minor, Engineering +8

Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree

Hans L. Bodlaender, John R. Gilbert, Hjálmtýr Hafsteinsson et al. · Journal of Algorithms · 1995 · 289 citations

Mathematical Programming, Tree Language, Engineering +9

On acyclic colorings of planar graphs

O. V. Borodin · Discrete Mathematics · 1979 · 265 citations

Geometric Graph Theory, Graph Theory, Planar Graph +4

Graphs and homomorphisms

Choice Reviews Online · 2005 · 255 citations

Structural Graph Theory, Topological Graph Theory, Graph Theory +1

On acyclic colorings of planar graphs

O. V. Borodin · Discrete Mathematics · 2006 · 236 citations

Geometric Graph Theory, Graph Theory, Planar Graph +4