Question: are all hamiltonian graph eulerian?
Answer: Is every Hamiltonian graph also an Euler? No. ... Hamiltonain is the one in which each vertex is visited exactly once except the starting and ending vertex(need to remember) and Euler allows vertex to be repeated more than once but each edge should be visited exactly once without any repetition.