Graphs with girth 9 and without longer odd holes are 3-colorable
Abstract
For a number l≥ 2, let Gl denote the family of graphs which have girth 2l+1 and have no odd hole with length greater than 2l+1. Wu, Xu and Xu conjectured that every graph in l≥ 2 Gl is 3-colorable. Chudnovsky et al., Wu et al., and Chen showed that every graph in G2, G3 and l≥ 5 Gl is 3-colorable respectively. In this paper, we prove that every graph in G4 is 3-colorable. This confirms Wu, Xu and Xu's conjecture.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.