Saved in:
Bibliographic Details
Main Authors: Wang, Yan, Wu, Rong
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2605.27943
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • For an integer $\ell\geq 2$, let ${\cal{H}}_{\ell}$ denote the family of graphs which have girth $2\ell$ and have no even hole of length greater than $2\ell$. Wu, Xu and Xu conjectured that every graph in $\bigcup_{\ell\geq 2} {\cal{H}}_{\ell}$ is $3$-colorable. Chen showed that every graph in $\bigcup_{\ell\geq 5} {\cal{H}}_{\ell}$ is $3$-colorable. In this paper, we prove that every graph in ${\cal{H}}_4$ is $3$-colorable.