According to this page

http://mathworld.wolfram.com/DodecahedralGraph.html

The dodecahedron does not have a Eulerian Path!

As a practical matter, this means one or more of the joints (edges) will have more than one transition.

]]>Certainly a step in the right direction. Although we want to visit each _edge_ only once, not each vertex.

]]>