Graphs with girth 9 and without longer odd holes are 3-colorable
Combinatorics
2023-07-06 v1
Abstract
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 -colorable. Chudnovsky et al., Wu et al., and Chen showed that every graph in , and is -colorable respectively. In this paper, we prove that every graph in is -colorable. This confirms Wu, Xu and Xu's conjecture.
Keywords
Cite
@article{arxiv.2307.01460,
title = {Graphs with girth 9 and without longer odd holes are 3-colorable},
author = {Yan Wang and Rong Wu},
journal= {arXiv preprint arXiv:2307.01460},
year = {2023}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2210.12376, arXiv:2301.00112 by other authors