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

R. Balakrishnan, J. Bermond, and P. Paulraja, On the decomposition of de bruijn graphs into hamiltonian cycles

D. Barth, Réseaux d'interconnection: structures et communications, 1994.

D. Barth, J. Bond, and A. Raspaud, Compatible eulerian circuits in Kn??????, Discrete Applied Mathematics, vol.56, issue.2-3, pp.127-136, 1995.
DOI : 10.1016/0166-218X(94)00083-P

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 Cycle Decomposition of the Butterfly Network, Parallel Processing Letters, vol.08, issue.03, 1996.
DOI : 10.1142/S0129626498000389
URL : https://hal.archives-ouvertes.fr/inria-00073777

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

J. Bermond and C. Peyrat, Broadcasting in de Bruijn networks, Proceedings of the 19th S-E conference on Combinatorics Congressus Numerantium 66 Graph theory, and Computing, pp.283-292, 1988.

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

H. Fleischner and B. Jackson, Compatible Euler Tours In Eulerian Digraphs, Cycles and Rays, Proceeding Colloquium Montréal, pp.95-100, 1987.
DOI : 10.1007/978-94-009-0517-7_9

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

R. Rowley and B. Bose, ON THE NUMBER OF ARC-DISJOINT HAMILTONIAN CIRCUITS IN THE DE BRUIJN GRAPH, Parallel Processing Letters, vol.03, issue.04, pp.375-380, 1993.
DOI : 10.1142/S0129626493000411

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

M. Syska, Communications dans les architectures a ` mémoire distribuée, 1992.

T. Tillson, A Hamiltonian decomposition of ¢ !