Circular chromatic numbers of a class of distance graphs Original Research Article

Suppose m,k,s are positive integers with m>sk. Let Dm,k,s denote the set {1,2,…,m}⧹{k,2k,…,sk}. The distance graph G(Z,Dm,k,s) has as vertex set all integers Z and edges connecting i and j whenever |i−j|∈Dm,k,s. This paper determines the circular chromatic number of all the distance graphs G(Z,Dm,k,s).