L. Du, A polynomial time algorithm for hamilton cycle. IMECS, I, pp.17-19, 2010.

L. Lovasz, Combinatorial problems and exercises. Noth-Holland, 1979.

R. C. Merkle and M. E. Hellman, Hiding information and receipts in trap door knapsacks, Internal Symposium on Information Theory, université Cornell, 1977.

D. S. Johnson and M. R. Garey, Computers and intractability:a guid to the theory of np-completeness, 1979.

M. Sghiar, Algorithmes quantiques, cycles hamiltoniens et la k-coloration des graphes, Pioneer Journal of Mathematics and Mathematical Sciences, vol.17, issue.1, pp.51-69, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01288408

M. Sghiar, Atomic algorithm and the servers' s use to find the hamiltonian cycles, International Journal of Engineering Research and Applications (IJERA), pp.23-30, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01340396

M. Sghiar, An electronic algorithm to find the optimal solution for the travelling salesman problem, IOSR Journal of Mathematics, vol.12, issue.04, pp.82-86, 2016.
DOI : 10.9790/5728-1204048286
URL : https://hal.archives-ouvertes.fr/hal-01353706