scientific article; zbMATH DE number 1439478

zbMath0963.68228MaRDI QIDQ4949857

Andreas M. Hinz, Jens-P. Bode

Publication date: 7 May 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Tower of Hanoi

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (13)

The diameter of Hanoi graphs ⋮ Computational solution of an old tower of Hanoi problem ⋮ Coloring Hanoi and Sierpiński graphs ⋮ Exponential vs. Subexponential Tower of Hanoi Variants ⋮ 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 ⋮ The linear \(t\)-colorings of Sierpiński-like graphs ⋮ Asymptotic aspects of Schreier graphs and Hanoi Towers groups. ⋮ 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 ⋮ Shortest paths in Sierpiński graphs

This page was built for publication: