gradnesetril2008

https://www.doi.org/10.1016/j.ejc.2006.07.014

@article{gradnesetril2008,
author = {Jaroslav Nešetřil and Patrice {Ossona de Mendez}},
doi = {10.1016/j.ejc.2006.07.014},
issn = {0195-6698},
journaltitle = {European Journal of Combinatorics},
number = {3},
pages = {777--791},
title = {Grad and classes with bounded expansion II. Algorithmic aspects},
volume = {29},
year = {2008},
}

d-path-free $k$ upper bounds treedepth by $k^{\mathcal O(1)}$
treedepth $k$ upper bounds d-path-free by $2^{\mathcal O(k)}$