A note on circular chromatic number of graphs with large girth and similar problems
Combinatorics
2014-02-14 v1
Abstract
In this short note, we extend the result of Galluccio, Goddyn, and Hell, which states that graphs of large girth excluding a minor are nearly bipartite. We also prove a similar result for the oriented chromatic number, from which follows in particular that graphs of large girth excluding a minor have oriented chromatic number at most , and for the th chromatic number , from which follows in particular that graphs of large girth excluding a minor have .
Keywords
Cite
@article{arxiv.1402.3142,
title = {A note on circular chromatic number of graphs with large girth and similar problems},
author = {Jaroslav Nesetril and Patrice Ossona De Mendez},
journal= {arXiv preprint arXiv:1402.3142},
year = {2014}
}