2 research outputs found
Graphs with bounded tree-width and large odd-girth are almost bipartite
We prove that for every and every , there exists such
that every graph with tree-width at most and odd-girth at least has
circular chromatic number at most