1. H. Adler and I. Adler: Interpreting nowhere dense graph classes as a classical notion of model theory, European Journal of Combinatorics36 (2014), 322–330.
2. R. Diestel: Graph theory, volume 173 of Graduate Texts in Mathematics, Springer, Heidelberg, fourth edition, 2010.
3. K. Eickmeyer, A. C. Giannopoulou, S. Kreutzer, O. Kwon, M. Pilipczuk, R. Rabinovich and S. Siebertz: Neighborhood complexity and kernelization for nowhere dense classes of graphs, in: Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl, editors, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), volume 80 of Leibniz International Proceedings in Informatics (LIPIcs), 1–14, Dagstuhl, Germany, 2017. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
4. S. Felsner, W. T. Trotter and V. Wiechert: The Dimension of Posets with Planar Cover Graphs, Graphs Combin. 31 (2015), 927–939.
5. M. Grohe, S. Kreutzer, R. Rabinovich, S. Siebertz and K. Stavropoulos: Colouring and covering nowhere dense graphs, in: Graph-Theoretic Concepts in Computer Science 41st International Workshop, WG 2015, 325–338, 2015.