d-path-free

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