Chromatic numbers of integer distance graphs (Q5936034)

An integer distance graph is a graph \(G(D)\) with the set of integers as the vertex set and with an edge joining two vertices \(a\) and \(b\) iff \(|a-b|\in D\), where \(D\) is a subset of the positive integers. The authors determine the chromatic numbers of integer distance graphs (i) if \(D\) consists of two different positive integers together with their sum and their (positive) differences and (ii) with finite or infinite distance sets which are arithmetical sequences.