Hamiltonian paths on Platonic graphs (Q1774780)

Summary: We develop a combinatorial method to show that the dodecahedron graph has, up to rotation and reflection, a unique Hamiltonian cycle. Platonic graphs with this property are called topologically uniquely Hamiltonian. The same method is used to demonstrate topologically distinct Hamiltonian cycles on the icosahedron graph and to show that a regular graph embeddable on the \(2\)-holed torus is topologically uniquely Hamiltonian.