T. Araki and Y. Shibata, Pancyclicity of recursive circulant graphs, Information Processing Letters, vol.81, issue.4, pp.187-190, 2002.
DOI : 10.1016/S0020-0190(01)00226-5

J. Bermond, F. Comellas, and D. F. Hsu, Distributed Loop Computer-Networks: A Survey, Journal of Parallel and Distributed Computing, vol.24, issue.1, pp.2-10, 1985.
DOI : 10.1006/jpdc.1995.1002

D. K. Biss, Hamiltonian decomposition of recursive circulant graphs, Discrete Mathematics, vol.214, issue.1-3, pp.89-99, 2000.
DOI : 10.1016/S0012-365X(99)00199-5

F. Boesch and R. Tindell, Circulants and their connectivities, Journal of Graph Theory, vol.8, issue.4, pp.487-499, 1984.
DOI : 10.1002/jgt.3190080406

Z. R. Bogdanowicz, Pancyclicity of connected circulant graphs, Journal of Graph Theory, vol.22, issue.2, pp.167-174, 1996.
DOI : 10.1002/(SICI)1097-0118(199606)22:2<167::AID-JGT7>3.0.CO;2-L

G. J. Chang, L. Huang, and X. Zhu, Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs, European Journal of Combinatorics, vol.19, issue.4, pp.423-431, 1998.
DOI : 10.1006/eujc.1997.0199

M. C. Lin, D. Rautenbach, F. J. Soulignac, and J. L. Szwarcfiter, Powers of cycles, powers of paths, and distance graphs, Discrete Applied Mathematics, vol.159, issue.7, pp.621-627, 2011.
DOI : 10.1016/j.dam.2010.03.012

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

B. Effantin and H. Kheddouci, The b-chromatic number of some power graphs, Discrete Math. Theor. Comput. Sci, vol.6, pp.45-54, 2003.

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

S. A. Evdokimov and I. N. Ponomarenko, Circulant graphs: recognizing and isomorphism testing in polynomial time, St. Petersburg Mathematical Journal, vol.15, issue.06, pp.813-835, 2004.
DOI : 10.1090/S1061-0022-04-00833-7

D. Gómez and J. Gutierrez, Ibeas. Connectedness of finite distance graphs. Networks, pp.204-209, 2012.

H. Harborth and S. Krause, Distance Ramsey numbers, Util. Math, vol.70, pp.197-200, 2006.

C. Heuberger, On hamiltonian Toeplitz graphs, Discrete Mathematics, vol.245, issue.1-3, pp.107-125, 2002.
DOI : 10.1016/S0012-365X(01)00136-4

URL : http://doi.org/10.1016/s0012-365x(01)00136-4

F. K. Hwang, A complementary survey on double-loop networks, Theoretical Computer Science, vol.263, issue.1-2, pp.211-229, 2001.
DOI : 10.1016/S0304-3975(00)00243-7

F. K. Hwang, A survey on multi-loop networks, Theoretical Computer Science, vol.299, issue.1-3, pp.107-121, 2003.
DOI : 10.1016/S0304-3975(01)00341-3

A. Kemnitz and M. Marangio, Colorings and list colorings of integer distance graphs, Congr. Numerantium, vol.151, pp.75-84, 2001.

A. Kemnitz and M. Marangio, Chromatic numbers of integer distance graphs, Discrete Mathematics, vol.233, issue.1-3, pp.239-246, 2001.
DOI : 10.1016/S0012-365X(00)00243-0

K. Kutnar and D. Maru?i?, Hamilton cycles and paths in vertex-transitive graphs???Current directions, Discrete Mathematics, vol.309, issue.17, pp.5491-5500, 2009.
DOI : 10.1016/j.disc.2009.02.017

C. Löwenstein, D. Rautenbach, and F. Regen, On Hamiltonian paths in distance graphs, Applied Mathematics Letters, vol.24, issue.7, pp.1075-1079, 2011.
DOI : 10.1016/j.aml.2011.01.025

M. Muzychuk, A solution of the isomorphism problem for circulant graphs, Proceedings of the London Mathematical Society, vol.88, issue.01, pp.1-41, 2004.
DOI : 10.1112/S0024611503014412

L. D. Penso, D. Rautenbach, and J. L. Szwarcfiter, Long cycles and paths in distance graphs, Discrete Mathematics, vol.310, issue.23, pp.3417-3420, 2010.
DOI : 10.1016/j.disc.2010.07.020

C. S. Raghavendra and J. A. Sylvester, A survey of multi-connected loop topologies for local computer networks, Computer Networks and ISDN Systems, vol.11, issue.1, pp.29-42, 1986.
DOI : 10.1016/0169-7552(86)90027-9

R. Van-dal, G. Tijssen, . Zs, J. A. Tuza, C. Van-der-veen et al., Hamiltonian properties of Toeplitz graphs, Discrete Mathematics, vol.159, issue.1-3, pp.69-81, 1996.
DOI : 10.1016/0012-365X(95)00111-9

M. Voigt, Colouring of distance graphs, Ars Combin, vol.52, pp.3-12, 1999.