Structural Properties of Sparse Graphs
From MaRDI portal
Publication:3601929
DOI10.1007/978-3-540-85221-6_13zbMath1260.05090MaRDI QIDQ3601929
Jaroslav Nešetřil, Patrice Ossona de Mendez
Publication date: 12 February 2009
Published in: Bolyai Society Mathematical Studies (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.2509
graph homomorphisms; nowhere dense graphs; shallow minors; density of graphs; classes of sparse graphs
Related Items
Graph sharing games: complexity and connectivity, Adapted game colouring of graphs, Colouring, constraint satisfaction, and complexity, Characterisations and examples of graph classes with bounded expansion, Rank-width and tree-width of \(H\)-minor-free graphs, Small graph classes and bounded expansion, Generalization of transitive fraternal augmentations for directed graphs and its applications, FPT algorithms for domination in sparse graphs and beyond, Reconfiguration on sparse graphs, Equitable list tree-coloring of bounded treewidth graphs