If G is a graph with k ≥ 1 odd cycle lengths then each block of G is either K2k+2 or contains a vertex of degree at most 2k. As a consequence, the chromatic number of G is at most 2k+2.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics