On an infinite family of solvable Hanoi graphs

DOI10.1145/1435375.1435388zbMath1451.05221OpenAlexW2105476091MaRDI QIDQ4962772

Shay Solomon, Noam Solomon, Dany Azriel

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1435375.1435388

zbMATH Keywords

Tower of Hanoioptimality proofs

Mathematics Subject Classification ID

Games involving graphs (91A43) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

The worst Hanoi graphs ⋮ The tower of Hanoi problem on Path\(_h\) graphs

This page was built for publication: On an infinite family of solvable Hanoi graphs