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

Abstract

We prove that every graph with bounded tree-width without short odd cycles has circular chromatic number arbitrarily close to two.

Keywords

• tree-width
• circular coloring
• large odd-girth