A tour of general Hanoi graphs

DOI10.1016/j.tcs.2023.114289MaRDI QIDQ6144016

Omrit Filtser, Daniel Berend, Liat Cohen

Publication date: 5 January 2024

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

zbMATH Keywords

planarityHamiltonicitytowers of Hanoi

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• The tower of Hanoi problem on Path\(_h\) graphs
• On the planarity of Hanoi graphs
• Hanoi graphs and some classical numbers
• The diameter of Hanoi graphs
• The number and degree distribution of spanning trees in the Tower of Hanoi graph
• The cyclic towers of Hanoi
• The average distance on the Sierpiński gasket
• On the treewidth of Hanoi graphs
• The fourth tower of Hanoi
• Exponential vs. Subexponential Tower of Hanoi Variants
• The Cyclic Towers of Hanoi: A Representation Approach
• The complexity of the generalised cyclic Towers of Hanoi problem
• Towers of hanoi graphs
• The Tower of Hanoi – Myths and Maths
• The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi)
• Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem
• Pascal's Triangle and the Tower of Hanoi
• On Optimal Solutions for the Bottleneck Tower of Hanoi Problem
• Developments in Language Theory

This page was built for publication: A tour of general Hanoi graphs