Pages that link to "Item:Q490248"
From MaRDI portal
The following pages link to The number of moves of the largest disc in shortest paths on Hanoi graphs (Q490248):
Displaying 5 items.
- Computational solution of an old tower of Hanoi problem (Q327694) (← links)
- An efficient algorithm to determine all shortest paths in Sierpiński graphs (Q406332) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- Open problems for Hanoi and Sierpiński graphs (Q2413332) (← links)
- A new lower bound for the Towers of Hanoi problem (Q2635086) (← links)
