The diameter of Hanoi graphs

DOI10.1016/j.ipl.2005.12.004zbMath1178.05089OpenAlexW2006916373MaRDI QIDQ844161

Daniel Berend, Amir Sapir

Publication date: 18 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.12.004

zbMATH Keywords

algorithmsgraph algorithmsdirected graphsgraph diametertower of Hanoi

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

A tour of general Hanoi graphs ⋮ The tower of Hanoi problem on Path\(_h\) graphs ⋮ Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph ⋮ Exponential vs. Subexponential Tower of Hanoi Variants ⋮ Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes ⋮ Shortest paths in Sierpiński graphs ⋮ Vertex-, edge-, and total-colorings of Sierpiński-like graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The cyclic towers of Hanoi
• On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
• The tower of Hanoi
• The cyclic multi-peg Tower of Hanoi
• Adjudicating a towers of hanoi contest†
• The complexity of the generalised cyclic Towers of Hanoi problem
• The Towers of Hanoi rainbow problem: Coloring the rings
• The Tower of Hanoi with Forbidden Moves

This page was built for publication: The diameter of Hanoi graphs