The worst Hanoi graphs
Abstract
References
Recommendations
A tour of general Hanoi graphs
AbstractThe Tower of Hanoi puzzle has fascinated researchers in mathematics and theoretical computer science for over a hundred years. Many variants of the classical puzzle have been posed, such as allowing more than 3 pegs, and adding restrictions on ...
Coloring Hanoi and Sierpiński graphs
It is shown that all Hanoi and Sierpinski graphs are in edge- and total coloring class 1, except those isomorphic to a complete graph of odd or even order, respectively. New proofs for their classification with respect to planarity are also given.
Solving Towers of Hanoi and Related Puzzles
Revised Selected Papers of the 14th International Conference on Computer Aided Systems Theory - EUROCAST 2013 - Volume 8111Starting with the well-known Towers of Hanoi, we create a new sequence of puzzles which can essentially be solved in the same way. Since graphs and puzzles are intimately connected, we define a sequence of graphs, the iterated complete graphs , for our ...
Comments
Information & Contributors
Information
Published In
Publisher
Elsevier Science Publishers Ltd.
United Kingdom
Publication History
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in