1. S.B. Akers, D. Harel, B. Krishnamurthy, The star graph: An attractive alternative to the n-cube, in: Proc. Internat. Conf. Parallel Processing, 1987, pp. 393–400
2. Gray codes for torus and edge disjoint Hamiltonian cycles;Bae,2000
3. Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes;Bae;IEEE Trans. Comput.,2003
4. R.C. Compton, Hamilton cycles in the Cayley graph of Sn and a doubly adjacent Gray code, Ph.D. thesis, Department of Mathematics, University of California, San Diego, 1990
5. Doubly adjacent Gray codes for the symmetric group: How to braid n strands;Compton;Linear and Multilinear Algebra,1993