Characterising bounded expansion by neighbourhood complexity
type: Item
instance of: scholarly article
title: Characterising bounded expansion by neighbourhood complexity
zbMATH Open document ID: 1400.05248
author: Felix Reidl
author: Fernando Sánchez Villaamil
author: Konstantinos S. Stavropoulos
published in: European Journal of Combinatorics
publication date: 2018-11-15T00:00:00Z
full work available at URL: https://arxiv.org/abs/1603.09532
full work available at URL: EURCOMB18.pdf
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6979674
zbMATH Keywords: weak \(r\)-colouring number
MaRDI profile type: Publication
OpenAlex ID: W2963177880
arXiv ID: 1603.09532
cites work: Polynomial-time data reduction for dominating set
cites work: (Meta) Kernelization
cites work: Homomorphism preservation on quasi-wide classes
cites work: Q5417628
cites work: Kernelization and Sparseness: the case of Dominating Set
cites work: Star coloring of graphs
cites work: Fixed-parameter tractability, definability, and model-checking
cites work: Bidimensionality and Geometric Graphs
cites work: Q5743379
cites work: Q2957874
cites work: Deciding first-order properties of locally tree-decomposable structures
cites work: Kernelization using structural parameters on sparse graph classes
cites work: Q2963895
cites work: Deciding First-Order Properties of Nowhere Dense Graphs
cites work: Structure theorem and isomorphism test for graphs with excluded topological subgraphs
cites work: Mean, Median and Mode in Binomial Distributions
cites work: Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
cites work: Grad and classes with bounded expansion. I: Decompositions
cites work: Grad and classes with bounded expansion. II: Algorithmic aspects
cites work: Sparsity. Graphs, structures, and algorithms
cites work: Characterisations and examples of graph classes with bounded expansion
cites work: Graph minors. XVI: Excluding a non-planar graph
cites work: Q5284545
cites work: The structure of graphs not admitting a fixed immersion
cites work: Colouring graphs with bounded generalized colouring number
Wikidata QID: Q129194828
DOI: 10.1016/J.EJC.2018.08.001
description: scientific article