| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657073 | Journal of Combinatorial Theory, Series B | 2010 | 6 Pages |
Abstract
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+ε.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
