Circular chromatic numbers of a class of distance graphs
For positive integers \(m\), \(k\), \(s\) with \(m\geq sk\) let \(D_{m,k,s}\) denote the set \(\{1,2,\dots, m\}\setminus\{k,2k,\dots, sk\}\). The distance graph has as vertices all integers and as edges the pairs \(i\), \(j\) with \(|i-j|\in D_{m,k,s}\). The author determines the circular chromatic number (a generalization of the star chromatic number) of all the distance graphs.
scientific article; zbMATH DE number 1915551