B. Codenotti, I. Gerace, and S. Vigna, Hardness results and spectral techniques for combinatorial problems on circulant graphs, Linear Algebra and its Applications, vol.285, issue.1-3, pp.123-142, 1998.
DOI : 10.1016/S0024-3795(98)10126-X

J. Chen, G. Chang, and K. Huang, Integral distance graphs, J. Graph Theory, vol.25, pp.281-287, 1997.

W. Deuber and X. Zhu, The chromatic number of distance graphs Discrete Math, pp.195-204, 1997.

R. B. Eggleton, P. Erd?-os, and D. K. Skilton, Colouring the real line, Journal of Combinatorial Theory, Series B, vol.39, issue.1, pp.86-100, 1985.
DOI : 10.1016/0095-8956(85)90039-5

R. B. Eggleton, P. Erd?-os, and D. K. Skilton, Colouring prime distance graphs, Graphs and Combinatorics, vol.58, issue.1, pp.17-32, 1990.
DOI : 10.1007/BF01787476

C. Heuberger, On planarity and colorability of circulant graphs, Discrete Math, pp.153-169, 2003.

A. Kemnitz and M. Marangio, Colorings and list colorings of integer distance graphs, 2003.

A. Kemnitz and M. Marangio, Chromatic number of integer distance graphs,Discrete Math, pp.239-246, 2001.

M. Voigt, Coloring of Distance graphs, Ars Combinatoria, vol.52, pp.3-12, 1999.

H. G. Yeh and X. Zhu, 4-colourable 6-regular toroidal graphs, Discrete Math, pp.261-274, 2003.
DOI : 10.1016/s0012-365x(03)00242-5

URL : http://doi.org/10.1016/s0012-365x(03)00242-5

X. Zhu, Circular chromatic number of distance graphs with distance sets of cardinality 3, Journal of Graph Theory, vol.229, issue.166, pp.195-207, 2002.
DOI : 10.1002/jgt.10062