English

Graphs with girth 8 and without longer even holes are 3-colorable

Combinatorics 2026-05-28 v1

Abstract

For an integer 2\ell\geq 2, let H{\cal{H}}_{\ell} denote the family of graphs which have girth 22\ell and have no even hole of length greater than 22\ell. Wu, Xu and Xu conjectured that every graph in 2H\bigcup_{\ell\geq 2} {\cal{H}}_{\ell} is 33-colorable. Chen showed that every graph in 5H\bigcup_{\ell\geq 5} {\cal{H}}_{\ell} is 33-colorable. In this paper, we prove that every graph in H4{\cal{H}}_4 is 33-colorable.

Keywords

Cite

@article{arxiv.2605.27943,
  title  = {Graphs with girth 8 and without longer even holes are 3-colorable},
  author = {Yan Wang and Rong Wu},
  journal= {arXiv preprint arXiv:2605.27943},
  year   = {2026}
}