Graphs with bounded tree-width and large odd-girth are almost bipartite

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 + ε.

• Type: Journal
• Year: 2010
• Where: JCT
• Authors: Alexandr V. Kostochka, Daniel Král', Jean-Sébastien Sereni, Michael Stiebitz
• Keywords: Circular Chromatic Number, JCT 2010, Tree-width