Coloring and Counting on the Tower of Hanoi Graphs

  title={Coloring and Counting on the Tower of Hanoi Graphs},
  author={Danielle Arett and Suzanne Dor{\'e}e},
  journal={Mathematics Magazine},
  pages={200 - 209}
Summary The Tower of Hanoi graphs make up a beautifully intricate and highly symmetric family of graphs that show moves in the Tower of Hanoi puzzle played on three or more pegs. Although the size and order of these graphs grow exponentially large as a function of the number of pegs, p, and disks, d (there are pd vertices and even more edges), their chromatic number remains remarkably simple. The interplay between the puzzles and the graphs provides fertile ground for counts, alternative counts… 
Sierpiński graphs as spanning subgraphs of Hanoi graphs
Hanoi graphs Hpn model the Tower of Hanoi game with p pegs and n discs. Sierpinski graphs Spn arose in investigations of universal topological spaces and have meanwhile been studied extensively. It
Anti-Ramsey Number of Hanoi Graphs
The anti-Ramsey number of Hanoi graphs is studied and the exact value of the anti- Ramsey number is presented in case when both graphs are constructed for the same number of pegs.
A counting algorithm for the generalized Spin-Out puzzle and recursive, iterative, and counting algorithms for the combination puzzle, a puzzle formed by a combination of concepts from both puzzles.
A Tale of Two Puzzles: Towers of Hanoi and Spin-Out
Counter to claims that Gray counting is needed to solve these puzzles, counting algorithms which solveThese puzzles using a standard binary counter are described and recursive and iterative algorithms for these puzzles are given.
Shortest paths in Sierpiński graphs
The Tower of Hanoi - Myths and Maths
This is the first comprehensive monograph on the mathematical theory of the solitaire game The Tower of Hanoi which was invented in the 19th century by the French number theorist douard Lucas and contains a thorough, largely self-contained presentation of the essential mathematical facts with complete proofs.
Laceability in Hanoi Graphs
The topological structure of an interconnection network can be modelled by a connected, simple and undirected graph \(G=(V,E)\) where \(V\) represents the set of processors and \(E\) represents the


Combinatorics of topmost discs of multi-peg Tower of Hanoi problem
Top-maps are introduced as maps which reflect topmost discs of regular states and the number of edges in graphs of the multi-peg Tower of Hanoi problem is counted to obtain some combinatorial identities.
The diameter of Hanoi graphs
Hanoi graphs and some classical numbers
The Group of Symmetries of the Tower of Hanoi Graph
The group of symmetries of the Tower of Hanoi graph with k pegs and n disks is isomorphic to the group of permutations of k elements, S_k, for all k greater than or equal to 3 and positive n.
On the planarity of Hanoi graphs
Towers of hanoi graphs
The notion of Hanoi Graph is introduced the first time for the Towers of Hanoi puzzle which greatly helps investigate the problem. And some new conclusions are presented in this paper.
Crossing numbers of Sierpiński‐like graphs
These are the first nontrivial families of graphs of “fractal” type whose crossing number is known and explicit drawings of these graphs are presented and proved to be optimal for S(n, k) and S( n, k).
The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi)
(1994). The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi) Mathematics Magazine: Vol. 67, No. 5, pp. 323-344.