1. B. Alspach, C.D. Godsil (Eds.), Open problems, in: Cycles in Graphs, Annals of Discrete Mathematics, vol. 27, North-Holland, Amsterdam, 1985, p. 463.
2. Hamiltonian cycles and paths in Cayley graphs and digraphs—a survey;Curran;Discrete Math.,1996
3. R.M. Foster, The Foster Census of Connected Symmetric Trivalent Graphs, extended and edited by I.Z. Bouwer, The Charles Babbage Research Centre, 1988.
4. Hamiltonian cycles in a class of random graphs: one step further;Frieze,1990
5. Fundamentals of Computer Algorithms;Horowitz,1978