Characterising bounded expansion by neighbourhood complexity
Authors:
- Felix ReidlFRFelix Reidl
- Fernando Sánchez VillaamilFVFernando Sánchez Villaamil
- Konstantinos StavropoulosKSKonstantinos Stavropoulos
- 1 January 2019
- journal article
- research article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 75, 152-168
Abstract
No abstract availableAll Related Versions
This publication has 15 references indexed in Scilit:
- Characterisations and examples of graph classes with bounded expansionEuropean Journal of Combinatorics, 2012
- Homomorphism preservation on quasi-wide classesJournal of Computer and System Sciences, 2010
- Colouring graphs with bounded generalized colouring numberDiscrete Mathematics, 2009
- Grad and classes with bounded expansion II. Algorithmic aspectsEuropean Journal of Combinatorics, 2008
- Grad and classes with bounded expansion I. DecompositionsEuropean Journal of Combinatorics, 2008
- Star coloring of graphsJournal of Graph Theory, 2004
- Polynomial-time data reduction for dominating setJournal of the ACM, 2004
- Graph Minors. XVI. Excluding a non-planar graphJournal of Combinatorial Theory, Series B, 2003
- Deciding first-order properties of locally tree-decomposable structuresJournal of the ACM, 2001
- Mean, Median and Mode in Binomial DistributionsStatistica Neerlandica, 1980