Hanoi graphs and some classical numbers
From MaRDI portal
Publication:813952
DOI10.1016/J.EXMATH.2005.05.003zbMATH Open1080.05009OpenAlexW2147290365MaRDI QIDQ813952FDOQ813952
Authors: Sandi Klavžar, Uroš Milutinović, Ciril Petr 
Publication date: 2 February 2006
Published in: Expositiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.exmath.2005.05.003
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
- The tower of Hanoi
- On the Frame--Stewart Conjecture about the Towers of Hanoi
- On the planarity of Hanoi graphs
- The Tower of Hanoi with Forbidden Moves
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simple explicit formulas for the Frame-Stewart numbers
- An iterative algorithm for the Tower of Hanoi with four pegs
Cited In (12)
- Pascal's Triangle and the Tower of Hanoi
- A tour of general Hanoi graphs
- The tower of Hanoi problem on Path\(_h\) graphs
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
- Exponential vs. Subexponential Tower of Hanoi Variants
- On the restricted Hanoi graphs
- The weighted tower of Hanoi
- Independent sets on the towers of Hanoi graphs
- Sierpiński graphs as spanning subgraphs of Hanoi graphs
- On Parking Functions and The Tower of Hanoi
- Coloring and counting on the tower of Hanoi graphs
Uses Software
This page was built for publication: Hanoi graphs and some classical numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q813952)
