Pathfinding on Polyhedra

Connect all the vertices of the polyhedron in a path. No vertex may be used twice. Such a path is called a Hamiltonian Path. Can you find a path whose end is the start again? This is a Hamiltonian Cycle and is not so easy to find.