Hamiltonian paths on Platonic graphs

Brian Hopkins

International Journal of Mathematics and Mathematical Sciences, 2004, vol. 2004, 1-4

Abstract:

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.

Date: 2004
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2004/931897.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2004/931897.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:931897

DOI: 10.1155/S0161171204307118

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().