Structural Properties of Sparse Graphs

DOI10.1007/978-3-540-85221-6_13zbMath1260.05090OpenAlexW2119567838MaRDI 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

zbMATH Keywords

graph homomorphismsnowhere dense graphsshallow minorsdensity of graphsclasses of sparse graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Density (toughness, etc.) (05C42)

Related Items (10)

Graph sharing games: complexity and connectivity ⋮ Adapted game colouring of graphs ⋮ Colouring, constraint satisfaction, and complexity ⋮ Equitable list tree-coloring of bounded treewidth graphs ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ FPT algorithms for domination in sparse graphs and beyond ⋮ Reconfiguration on sparse graphs ⋮ Small graph classes and bounded expansion ⋮ Rank-width and tree-width of \(H\)-minor-free graphs ⋮ Generalization of transitive fraternal augmentations for directed graphs and its applications

This page was built for publication: Structural Properties of Sparse Graphs