Graphs with girth 8 and without longer even holes are 3-colorable
Abstract
For an integer ≥ 2, let H denote the family of graphs which have girth 2 and have no even hole of length greater than 2. Wu, Xu and Xu conjectured that every graph in ≥ 2 H is 3-colorable. Chen showed that every graph in ≥ 5 H is 3-colorable. In this paper, we prove that every graph in H4 is 3-colorable.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.