Chen, Jer-Jeong; Chang, Gerard J.; Huang, Kuo-Ching Integral distance graphs. (English) Zbl 0878.05028 J. Graph Theory 25, No. 4, 287-294 (1997). For some \(D\subset N^+\) the distance graph \(G(Z,D)\) has an edge connecting any two integers with a distance appearing in \(D\). It is proven that for finite \(D\), \(|D|+1\) is a sharp upper bound for the chromatic number of \(G(Z,D)\). This number is then determined exactly for almost all triplets \(D\). Reviewer: F.Plastria (Brussels) Cited in 1 ReviewCited in 24 Documents MSC: 05C12 Distance in graphs 05C15 Coloring of graphs and hypergraphs Keywords:distance graph; vertex; coloring; chromatic number PDFBibTeX XMLCite \textit{J.-J. Chen} et al., J. Graph Theory 25, No. 4, 287--294 (1997; Zbl 0878.05028) Full Text: DOI