The worst Hanoi graphs

DOI10.1016/J.TCS.2013.05.020zbMath1301.05151OpenAlexW1981139756MaRDI QIDQ391208

Ernst L. Leiss

Publication date: 10 January 2014

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

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

zbMATH Keywords

maximal number of movestowers of Hanoi

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

The worst parallel Hanoi graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On a question of Leiss regarding the Hanoi Tower problem
• The cyclic towers of Hanoi
• The Tower of Hanoi – Myths and Maths
• The Cyclic Towers of Hanoi: A Representation Approach
• The Tower of Hanoi with Forbidden Moves
• On an infinite family of solvable Hanoi graphs

This page was built for publication: The worst Hanoi graphs