On chromatic numbers of some distance graphs
  In this paper we find chromatic numbers of distance graphs $G(n,3,2)$ for infinitely many n. Also we improve upper bound for $\chi(G(n,r,s))$ in large part of cases. 
D. Zakharov
math.CO