2015/03/27 by Aurélie Lagoutte, Lagoutte, Aurélie
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1503.08057
openalex publication_date 2015/03/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 graphs are χ-bounded but we allow here the existence of C4. The proof relies on the concept of Parity Changing Path, an adaptation of Trinity Changing Path which was recently introduced by Bonamy, Charbit and Thomassé to prove that graphs with no induced cycle of length divisible by three have bounded chromatic number.