Towers of hanoi graphs

DOI10.1080/00207168608803502zbMath0656.05064OpenAlexW2062355182MaRDI QIDQ3803164

Xuemiao Lu

Publication date: 1986

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168608803502

zbMATH Keywords

Hamiltonian cycleminimal pathHanoi GraphTowers of Hanoid puzzle

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (18)

A note on parallelism for the towers of Hanoi ⋮ Four encounters with Sierpiński's gasket ⋮ A loopless approach to the multipeg towers of hanoi ⋮ The complexity of an optimal algorithm for the generalized tower of hanoi problem ⋮ A tour of general Hanoi graphs ⋮ Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph ⋮ Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes ⋮ Towers of hanoi problem with arbitraryk≧3 pages ⋮ The number of moves of the largest disc in shortest paths on Hanoi graphs ⋮ Enumeration of spanning trees on Apollonian networks ⋮ Tutte polynomial of the Apollonian network ⋮ A statistical analysis of the towers of hanoi problem ⋮ Shortest paths between regular states of the Tower of Hanoi ⋮ On the planarity of Hanoi graphs ⋮ Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence ⋮ Shortest paths in Sierpiński graphs ⋮ Parallelism for multipeg towers of Hanoi ⋮ The average distance on the Sierpiński gasket

Cites Work

• The towers of Hanoi revisited: Moving the rings by counting the moves
• Adjudicating a towers of hanoi contest†
• Discussion and correspondence: A note on the Towers of Hanoi problem

This page was built for publication: Towers of hanoi graphs