Characterisations of Nowhere Dense Graphs (Invited Talk)
Nowhere dense classes of graphs were introduced by Nesetril and Ossona de Mendez as a model for "sparsity" in graphs. It turns out that nowhere dense classes of graphs can be characterised in many different ways and have been shown to be equivalent to other concepts studied in areas such as (finite) model theory. Therefore, the concept of nowhere density seems to capture a natural property of graph classes generalising for example classes of graphs which exclude a fixed minor, have bounded degree or bounded local tree-width. In this paper we give a self-contained introduction to the concept of nowhere dense classes of graphs focussing on the various ways in which they can be characterised. We also briefly sketch algorithmic applications these characterisations have found in the literature.
Graph Algorithms
Algorithmic Graph Structure Theory
Finite Model Theory
Nowhere Dense Classes of Graphs
21-40
Invited Talk
Martin
Grohe
Martin Grohe
Stephan
Kreutzer
Stephan Kreutzer
Sebastian
Siebertz
Sebastian Siebertz
10.4230/LIPIcs.FSTTCS.2013.21
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode