Publication:4949857
From MaRDI portal
zbMath0963.68228MaRDI QIDQ4949857
Publication date: 7 May 2000
68W05: Nonnumerical algorithms
Related Items
Computational solution of an old tower of Hanoi problem, Coloring Hanoi and Sierpiński graphs, The number of moves of the largest disc in shortest paths on Hanoi graphs, Coloring the square of Sierpiński graphs, Stockmeyer's tower, On the planarity of Hanoi graphs, A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles, Shortest paths in Sierpiński graphs, The diameter of Hanoi graphs, The linear \(t\)-colorings of Sierpiński-like graphs, The \((d, 1)\)-total labelling of Sierpiński-like graphs, Asymptotic aspects of Schreier graphs and Hanoi Towers groups., Exponential vs. Subexponential Tower of Hanoi Variants