Question: is every hamiltonian graph eulerian?
Answer: No. A Hamiltonian path visits each vertex exactly once but may repeat edges. An Eulerian circuit traverses every edge in a graph exactly once but may repeat vertices.