Hamiltonian paths on Platonic graphs
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...
Saved in:
Main Author: | Brian Hopkins |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2004-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Online Access: | http://dx.doi.org/10.1155/S0161171204307118 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Hamiltonian-connected graphs and their strong closures
by: Pak-Ken Wong
Published: (1997-01-01) -
Notes on sufficient conditions for a graph to be Hamiltonian
by: Michael Joseph Paul, et al.
Published: (1991-01-01) -
Hamiltonian paths passing through matchings in hypercubes with faulty edges
by: Shenyang Zhao, et al.
Published: (2024-11-01) -
HIPIAS MENOR PLATÓN
Published: (2017-01-01) -
Platon'un Matematiği
by: Anders Wedberg, et al.
Published: (1999-07-01)