We prove that for every k and every ε>0, there exists g such that every graph with tree-width at most k and odd-girth at least g has circular chromatic number at most 2+ε.
- Circular coloring
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics