English

Graphs with girth 9 and without longer odd holes are 3-colorable

Combinatorics 2023-07-06 v1

Abstract

For a number l2l\geq 2, let Gl{\cal{G}}_l denote the family of graphs which have girth 2l+12l+1 and have no odd hole with length greater than 2l+12l+1. Wu, Xu and Xu conjectured that every graph in l2Gl\bigcup_{l\geq 2} {\cal{G}}_{l} is 33-colorable. Chudnovsky et al., Wu et al., and Chen showed that every graph in G2{\cal{G}}_2, G3{\cal{G}}_3 and l5Gl\bigcup_{l\geq 5} {\cal{G}}_{l} is 33-colorable respectively. In this paper, we prove that every graph in G4{\cal{G}}_4 is 33-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