The worst Hanoi graphs

The 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 ...

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.

Starting 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 ...