page 9 : distance to chordal $k$ upper bounds chordality by $\mathcal O(k)$ – (ed: apparently goes as the lemma for ddist to interval and boxicity) Lemma 4.16. The distance $i$ to an interval graph upper bounds the boxicity $b$. We have $b \le i+1$.
page 10 : feedback vertex set $k$ upper bounds distance to chordal by $\mathcal O(k)$ – Lemma 4.20. The feedback edge set number $f$ upper bounds the distance to a chordal graph $c$. We have $c \le f$.
