The tower of Hanoi
From MaRDI portal
Publication:1813640
zbMath0746.05035MaRDI QIDQ1813640
Publication date: 25 June 1992
Published in: L'Enseignement Mathématique. 2e Série (Search for Journal in Brave)
Related Items (35)
Four encounters with Sierpiński's gasket ⋮ Distances in Sierpiński graphs and on the Sierpiński gasket ⋮ The diameter of Hanoi graphs ⋮ Sierpiński graphs as spanning subgraphs of Hanoi graphs ⋮ An iterative algorithm for the Tower of Hanoi with four pegs ⋮ Complexity of Toeplitz sequences ⋮ Enumeration of matchings in families of self-similar graphs ⋮ The average eccentricity of Sierpiński graphs ⋮ Enumeration of maximum matchings in the Hanoi graphs using matching polynomials ⋮ An efficient algorithm to determine all shortest paths in Sierpiński graphs ⋮ Coloring Hanoi and Sierpiński graphs ⋮ Power domination in Knödel graphs and Hanoi graphs ⋮ Random walks on dual Sierpinski gaskets ⋮ Resistance scaling and the number of spanning trees in self-similar lattices ⋮ Diameters, distortion, and eigenvalues ⋮ Twin towers of Hanoi ⋮ Some topics in the dynamics of group actions on rooted trees. ⋮ Growth of Schreier graphs of automaton groups. ⋮ The number of moves of the largest disc in shortest paths on Hanoi graphs ⋮ Coloring the square of Sierpiński graphs ⋮ Shortest paths between regular states of the Tower of Hanoi ⋮ A survey and classification of Sierpiński-type graphs ⋮ On the planarity of Hanoi graphs ⋮ The linear \(t\)-colorings of Sierpiński-like graphs ⋮ Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence ⋮ The \((d, 1)\)-total labelling of Sierpiński-like graphs ⋮ A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles ⋮ ECCENTRIC DISTANCE SUM OF SIERPIŃSKI GASKET AND SIERPIŃSKI NETWORK ⋮ Enumerating submultisets of multisets ⋮ Shortest paths in Sierpiński graphs ⋮ The average distance on the Sierpiński gasket ⋮ The generalized Towers of Hanoi for space-deficient computers and forgetful humans ⋮ Recognizing generalized Sierpiński graphs ⋮ Graphs S(n, k) and a Variant of the Tower of Hanoi Problem ⋮ Hanoi graphs and some classical numbers
This page was built for publication: The tower of Hanoi
