The following pages link to (Q4949857):
Displayed 13 items.
- Computational solution of an old tower of Hanoi problem (Q327694) (← links)
- Coloring Hanoi and Sierpiński graphs (Q411656) (← links)
- The number of moves of the largest disc in shortest paths on Hanoi graphs (Q490248) (← links)
- Coloring the square of Sierpiński graphs (Q497382) (← links)
- Stockmeyer's tower (Q526310) (← links)
- On the planarity of Hanoi graphs (Q699008) (← links)
- A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles (Q730903) (← links)
- Shortest paths in Sierpiński graphs (Q741754) (← links)
- The diameter of Hanoi graphs (Q844161) (← links)
- The linear \(t\)-colorings of Sierpiński-like graphs (Q2014728) (← links)
- The \((d, 1)\)-total labelling of Sierpiński-like graphs (Q2279623) (← links)
- Asymptotic aspects of Schreier graphs and Hanoi Towers groups. (Q2499644) (← links)
- Exponential vs. Subexponential Tower of Hanoi Variants (Q2971384) (← links)