Nowhere dense classes of graphs

DOI10.14279/depositonce-5011zbMATH Open1548.05013MaRDI QIDQ6633487

Sebastian Siebertz

Publication date: 5 November 2024

Published in: Foundations of Computing (Search for Journal in Brave)

zbMATH Keywords

first-order logicbounded degree graphsfinite model theoryalgorithmic graph structure theoryparameterized complexity theorygraph classes of bounded expansioncolouring numbersGaifman's locality theoremdense graph classes

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Graph minors (05C83) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantifier elimination, model completeness, and related topics (03C10) Density (toughness, etc.) (05C42)

Related Items (1)

Discrepancy and sparsity

This page was built for publication: Nowhere dense classes of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6633487)