Circular chromatic numbers of some distance graphs (Q1773363): Difference between revisions

The circular chromatic number of a graph is a natural generalization of the chromatic number (introduced under the name star chromatic number) of a graph. It is the infimum of the ratios \(p/q\) for which there exist \((p,q)\)-colourings of a graph. The authors determine the circular chromatic numbers of some graphs.