Coloring graphs with no even hole $\ge 6$: the triangle-free case

Aurélie Lagoutte

In this paper, we prove that the class of graphs with no triangle and no induced cycle of even length at least 6 has bounded chromatic number. It is well-known that even-hole-free…