Title of article
Graphs with bounded tree-width and large odd-girth are almost bipartite
Author/Authors
Kostochka، نويسنده , , Alexandr V. and Krلlʹ، نويسنده , , Daniel and Sereni، نويسنده , , Jean-Sébastien and Stiebitz، نويسنده , , Michael، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
6
From page
554
To page
559
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
tree-width , Circular coloring , Odd-girth
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2010
Journal title
Journal of Combinatorial Theory Series B
Record number
1528081
Link To Document