Informace o publikaci
Graphs with bounded tree-width and large odd-girth are almost bipartite
| Autoři | |
|---|---|
| Rok publikování | 2010 |
| Druh | Článek v odborném periodiku |
| Časopis / Zdroj | JOURNAL OF COMBINATORIAL THEORY SERIES B |
| Citace | |
| Doi | http://dx.doi.org/10.1016/j.jctb.2010.04.004 |
| Klíčová slova | Circular coloring; Odd-girth; Tree-width |
| Popis | We prove that for every k and every epsilon > 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 + epsilon. (C) 2010 Elsevier Inc. All rights reserved. |