Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4654544 | European Journal of Combinatorics | 2008 | 17 Pages |
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 GGwith rank rr, ∇r(G)∇r(G). For these classes we prove the existence of several partition results such as the existence of low tree-width and low tree-depth colorings. This generalizes and simplifies several earlier results (obtained for minor closed classes).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jaroslav Nešetřil, Patrice Ossona de Mendez,