Name
Abstract | ||
|---|---|---|
We prove that for every k and every @e0, 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+@e. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.jctb.2010.04.004 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
bounded tree-width,tree-width,circular chromatic number,large odd-girth,odd-girth,circular coloring,tree width | Discrete mathematics,Graph,Combinatorics,Chromatic scale,Bipartite graph,Star (graph theory),Treewidth,Circular coloring,Mathematics,Bounded function | Journal |
Volume | Issue | ISSN |
100 | 6 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
1 | 0.34 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexandr V. Kostochka | 1 | 682 | 89.87 |
| Daniel Král' | 2 | 426 | 46.78 |
| Jean-Sébastien Sereni | 3 | 269 | 28.69 |
| Michael Stiebitz | 4 | 207 | 30.08 |