The Grad of a Graph and Classes with Bounded Expansion

https://doi.org/10.1016/j.endm.2005.06.018Get rights and content

Abstract

We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r, r(G). We generalize to these classes some results proved for proper minor closed classes and bounded degree graphs, such as the existence of low tree-width colorings and homomorphism dualities.

References (6)

There are more references available in the full text version of this article.

Cited by (24)

  • Colouring edges with many colours in cycles

    2014, Journal of Combinatorial Theory. Series B
  • Characterisations and examples of graph classes with bounded expansion

    2012, European Journal of Combinatorics
    Citation Excerpt :

    Yet in several aspects, the new graph inherits the structure of the original. A further generalisation consists in classes of graphs having bounded expansion, as introduced by Nešetřil and Ossona de Mendez [56,57,59]. Roughly speaking, these classes are defined by the fact that the maximum average degree of a shallow minor of a graph in the class is bounded by a function of the depth of the shallow minor.

  • How many F's are there in G?

    2011, European Journal of Combinatorics
    Citation Excerpt :

    A general view of the integration of usual sparse classes within this classification scheme is presented in Fig. 2. In this figure there appear in particular bounded expansion classes which were defined by the authors in [10,9,12,11,14], and almost wide and quasi-wide classes which were defined by Atserias et al. in a model theory context (cf. [2] for instance). The trichotomy theorem which we recall now was the first attempt at a classification of classes of graphs.

  • Homomorphism preservation on quasi-wide classes

    2010, Journal of Computer and System Sciences
  • Fraternal augmentations, arrangeability and linear Ramsey numbers

    2009, European Journal of Combinatorics
    Citation Excerpt :

    Kierstead, Trotter [11] We review some definitions and notation introduced in [17–20]: Now we shall replace the acyclicity condition by a transitivity condition.

View all citing articles on Scopus
View full text