Graphs with bounded tree-width and large odd-girth are almost bipartite
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
We prove that for every $k$ and every $\varepsilon>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+\varepsilon$.