Are there any good digraph width measures?

Parameterized Complexity

Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text

Computing, Computer Science, Mathematics +12

Some simplified NP-complete graph problems

M. R. Garey, David S. Johnson, Larry Stockmeyer · Theoretical Computer Science · 1976 · 2.1K citations

Computing, Computer Science, Mathematics +11

Graph minors. II. Algorithmic aspects of tree-width

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

Computing, Computer Science, Mathematics +14

The monadic second-order logic of graphs. I. Recognizable sets of finite graphs

Bruno Courcelle · Information and Computation · 1990 · 1.5K citations

Natural Sciences, Computer Science, Mathematics +10

On colouring the nodes of a network

Rachelle L. Brooks · Mathematical Proceedings of the Cambridge Philosophical Society · 1941 · 1K citations

Computing, Visualization, Graph Visualization +1