Chi-boundedness of graphs containing no cycles with $k$ chords

Abstract

We prove that the family of graphs containing no cycle with exactly $k$-chords is $\chi$-bounded, for $k$ large enough or of form $\ell (\ell -2)$ with $\ell \ge 3$ an integer. This verifies (up to a finite number of values $k$) a conjecture of Aboulker and Bousquet (2015).

arXiv comment38 pages, 13 figures