B. Alspach, Research problem 59, Discrete Mathematics, vol.50, p.115, 1984.

B. Alspach, J. Bermond, and D. Sotteau, Decomposition into Cycles I: Hamilton Decompositions, Cycles and Rays, Proceeding Colloquium Montréal, pp.9-18, 1987.
DOI : 10.1007/978-94-009-0517-7_2

J. Aubert and B. Schneider, Decomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens, Discrete Mathematics, vol.38, issue.1, pp.7-16, 1982.
DOI : 10.1016/0012-365X(82)90163-7

D. Barth and A. Raspaud, Two edge-disjoint hamiltonian cycles in the butterfly graph, Information Processing Letters, vol.51, issue.4, pp.175-179, 1994.
DOI : 10.1016/0020-0190(94)00087-5

J. Bermond, E. Darrot, O. Delmas, and S. Perennes, Hamilton circuits in the directed wrapped Butterfly network, Discrete Applied Mathematics, vol.84, issue.1-3, 1995.
DOI : 10.1016/S0166-218X(97)00095-4

URL : https://hal.archives-ouvertes.fr/hal-00407356

J. Bermond, O. Favaron, and M. Maheo, Hamiltonian decomposition of Cayley graphs of degree 4, Journal of Combinatorial Theory, Series B, vol.46, issue.2, pp.142-153, 1989.
DOI : 10.1016/0095-8956(89)90040-3

S. J. Curran and J. A. Gallian, Hamilton cycles and paths in Cayley graphs and digraphs -a survey

F. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees . Hypercubes. Computer Science, Mathematics Electrical Engineering, 1992.

R. Jean-de, Communication dans les réseaux de processeurs, Collection Etudes et Recherches en Informatique. Masson, 1994.

T. Tillson and C. ¡. Hamiltonian-decomposition-of, A Hamiltonian decomposition of K2m???, 2m ??? 8, Journal of Combinatorial Theory, Series B, vol.29, issue.1, pp.68-74, 1980.
DOI : 10.1016/0095-8956(80)90044-1