Sparsity. Graphs, structures, and algorithms
From MaRDI portal
Publication:419416
DOI10.1007/978-3-642-27875-4zbMath1268.05002WikidataQ55868072 ScholiaQ55868072MaRDI QIDQ419416
Patrice Ossona de Mendez, Jaroslav Nešetřil
Publication date: 18 May 2012
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-27875-4
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05C75: Structural characterization of families of graphs
05C83: Graph minors
05C85: Graph algorithms (graph-theoretic aspects)
03C13: Model theory of finite structures
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
05C42: Density (toughness, etc.)
Related Items
Grid minors in damaged grids, Colouring edges with many colours in cycles, Decomposition of bounded degree graphs into \(C_4\)-free subgraphs, Practical algorithms for MSO model-checking on tree-decomposable graphs, How to play Thue games, A note on Fiedler value of classes with sublinear separators, Interpreting nowhere dense graph classes as a classical notion of model theory, Distance-two coloring of sparse graphs, On the tree-depth of random graphs, Many large eigenvalues in sparse graphs
