References
- B. Alspach, J.C. Bermond, and D. Sotteau, Decomposition into cycles I: Hamilton decompositions. in Cycles and Rays, G. Hahn, G. Sabidussi, and R.E. Woodrow, eds., Kluwer Academic Publisher, Boston, 1990, pp. 9–18.
- M.M. Bae and B. Bose, Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes, IEEE Trans. Comput. 52 (2003), pp. 1271–1284. doi: 10.1109/TC.2003.1234525
- A.J.W. Hilton, Hamiltonian decompositions of complete graphs, J. Combin. Theory Ser. B 36 (1984), pp. 125–134. doi: 10.1016/0095-8956(84)90020-0
- S. Lakshmivarahan, J.-S. Jwo, and S.K. Dhall, Symmetry in interconnection networks based on Cayley graphs of permutation groups: a survey, Parallel Comput. 19 (1993), pp. 361–407. doi: 10.1016/0167-8191(93)90054-O
- H.z. Shi and P.f. Niu, Hamiltonian decomposition of some interconnection networks, in Combinatorial Optimization and Applications, D.-Z. Du, X. Hu, and P.M. Pardalos, eds., Springer, Huangshan, 2009, pp. 231–237
- H.-z. Shi, P.-f. Niu, and J.-b. Lu, One conjecture of Bubble-Sort graphs, Inform. Process. Lett. 111 (2011), pp. 926–929. doi: 10.1016/j.ipl.2011.06.005
- Y.-K. Shih, C.-K. Lin, D.F. Hsu, J.J.M. Tan, and L.-H. Hsu, The construction of mutually independent Hamiltonian cycles in Bubble-Sort graphs, Int. J. Comput. Math. 87 (2010), pp. 2212–2225. doi: 10.1080/00207160802512700