Graphs with girth 2ℓ+1 $2\ell +1$ and without longer odd holes are 3‐colorable
Rong Chen · Journal of Graph Theory · 2024
Abstract For a number , let denote the family of graphs which have girth and have no odd hole with length greater than . Wu et al. conjectured that every graph in is 3‐colorable. Chudnovsky et al. and Wu et al., respectively, proved that every graph in and is 3‐colorable. In this paper, we prove that every graph in is 3‐colorable.