1. Interpreting nowhere dense graph classes as a classical notion of model theory
2. The structure of almost all graphs in a hereditary property
3. Stefan Arnborg , Jens Lagergren , and Detlef Seese . 1988. Problems easy for tree-decomposable graphs (extended abstract) . In Automata, Languages and Programming, Timo Lepistö and Arto Salomaa (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg . 38–51. isbn:978-3-540-39291-0 Stefan Arnborg, Jens Lagergren, and Detlef Seese. 1988. Problems easy for tree-decomposable graphs (extended abstract). In Automata, Languages and Programming, Timo Lepistö and Arto Salomaa (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 38–51. isbn:978-3-540-39291-0
4. Second-order quantifiers and the complexity of theories.
5. József Balogh , Béla Bollobás , and Robert Morris . 2006. Hereditary properties of ordered graphs . In Topics in discrete mathematics . Springer , 179–213. József Balogh, Béla Bollobás, and Robert Morris. 2006. Hereditary properties of ordered graphs. In Topics in discrete mathematics. Springer, 179–213.