scientific article

zbMath1231.05223MaRDI QIDQ3096706

Jaroslav Nešetřil, Patrice Ossona de Mendez

Publication date: 11 November 2011

Full work available at URL: http://ebooks.worldscinet.com/ISBN/9789814324359/9789814324359_0156.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexitygraphshypergraphshomomorphismmodel checkingstructuresproperty testingsparsityseparatorsbounded expansionstructural combinatorics

Mathematics Subject Classification ID

Hypergraphs (05C65) Specification and verification (program logics, model checking, etc.) (68Q60) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19)

Related Items (3)

Modeling limits in hereditary classes: reduction and application to trees ⋮ First-order limits, an analytical perspective ⋮ A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth

This page was built for publication: