The worst parallel Hanoi graphs

DOI10.1016/J.TCS.2017.09.012zbMath1380.05130OpenAlexW2759086409MaRDI QIDQ1680542

Isaac Mackey, Ernst L. Leiss

Publication date: 16 November 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.09.012

zbMATH Keywords

Hanoi graphsmaximal number of movestowers of Hanoiparallel moves

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph

Cites Work

• The worst Hanoi graphs
• On a question of Leiss regarding the Hanoi Tower problem
• The cyclic towers of Hanoi
• The Tower of Hanoi – Myths and Maths
• The cyclic multi-peg Tower of Hanoi
• The Cyclic Towers of Hanoi: A Representation Approach
• The Tower of Hanoi with Forbidden Moves
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The worst parallel Hanoi graphs