Graphs with girth 9 and without longer odd holes are 3‐colourable

For a number , let denote the family of graphs which have girth and have no odd hole with length greater than . Wu, Xu and Xu conjectured that every graph in is 3‐colourable. Chudnovsky et al., Wu et al., and Chen showed that every graph in , and is 3‐colourable, respectively. In this paper, we prove that every graph in is 3‐colourable. This confirms Wu, Xu and Xu's conjecture.