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

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/227083We 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$.Combinatorics05C15; 05C83Graphs with bounded tree-width and large odd-girth are almost bipartitetext