Recouvrements Hamiltoniens de certains graphes

We study the possibility of covering some graphs with Hamiltonian chains. The results are applied to the particular case of the divisorial graph to give some new answers to a question asked by P. Erdِs.