Colouring of distance graphs (Q2760982)

For a set \(D\) of positive integers, the distance graph \(G(D)\) has the integers as vertex set and two integers \(u,v\) are adjacent if \(|u-v|\in D\). The question of determining the chromatic number of distance graphs and first results can be found in \textit{R. B. Eggleton, P. Erdős}, and \textit{D. K. Skilton} [J. Comb. Theory, Ser. B 39, 86-100 (1985; Zbl 0549.05029)]. The author made a good progress towards answering this question for all three-element sets \(D\).