Graphs with girth 8 and without longer even holes are 3-colorable
Combinatorics
2026-05-28 v1
Abstract
For an integer , let denote the family of graphs which have girth and have no even hole of length greater than . Wu, Xu and Xu conjectured that every graph in is -colorable. Chen showed that every graph in is -colorable. In this paper, we prove that every graph in is -colorable.
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}
}