@article{5ada90d6c37144cb82b5a7f37e2b10d6,
title = "Graphs with bounded tree-width and large odd-girth are almost bipartite",
abstract = "We prove that for every k and every ε>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+ε.",
keywords = "Circular coloring, Odd-girth, Tree-width",
author = "Kostochka, {Alexandr V.} and Daniel Kr{\'a}l' and Sereni, {Jean S{\'e}bastien} and Michael Stiebitz",
note = "Funding Information: E-mail addresses:
[email protected] (A.V. Kostochka),
[email protected] (D. Kr{\'a}l{\textquoteright}),
[email protected] (J.-S. Sereni),
[email protected] (M. Stiebitz). 1 This author{\textquoteright}s work was partially supported by NSF grant DMS-0650784 and by grant 09-01-00244-a of the Russian Foundation for Basic Research. 2 The Institute for Theoretical Computer Science (ITI) is supported by Ministry of Education of the Czech Republic as project 1M0545. This research has also been supported by the grant GACR 201/09/0197.",
year = "2010",
month = nov,
doi = "10.1016/j.jctb.2010.04.004",
language = "English (US)",
volume = "100",
pages = "554--559",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "6",
}