加载中…
For a number , let denote the family of graphs which have girth and have no odd hole with length greater than . Plummer and Zha conjectured that every 3-connected and internally 4-connected graph in is 3-colorable. Wu, Xu, and Xu 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本