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

From MaRDI portal



Abstract: 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.












This page was built for publication: Graphs with bounded tree-width and large odd-girth are almost bipartite

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q602711)