The diameter of Hanoi graphs
From MaRDI portal
Publication:844161
DOI10.1016/J.IPL.2005.12.004zbMATH Open1178.05089OpenAlexW2006916373MaRDI QIDQ844161FDOQ844161
Publication date: 18 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.12.004
Recommendations
- The diameter of directed graphs
- Publication:2766678
- The diameter of protean graphs
- On the diameter of Kneser graphs
- A generalisation of the diameter of a graph
- Diameter of path graphs
- The Diameter of a Graph and its Complement
- Some properties of graphs of diameters
- On the diameter of Kronecker graphs
- On diameter of permutation graphs
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)
Cites Work
- On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- The tower of Hanoi
- The cyclic towers of Hanoi
- The Tower of Hanoi with Forbidden Moves
- The cyclic multi-peg Tower of Hanoi
- The complexity of the generalised cyclic Towers of Hanoi problem
- Adjudicating a towers of hanoi contest†
- The Towers of Hanoi rainbow problem: Coloring the rings
Cited In (10)
- A tour of general Hanoi graphs
- Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph
- The tower of Hanoi problem on Path\(_h\) graphs
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
- Shortest paths in Sierpiński graphs
- How to do a half-turn in the cyclic tower of Hanoi
- Exponential vs. Subexponential Tower of Hanoi Variants
- On the restricted Hanoi graphs
- Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes
- On the treewidth of Hanoi graphs
This page was built for publication: The diameter of Hanoi graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844161)
