The following pages link to The tower of Hanoi (Q1813640):
Displaying 35 items.
- Sierpiński graphs as spanning subgraphs of Hanoi graphs (Q352716) (← links)
- An efficient algorithm to determine all shortest paths in Sierpiński graphs (Q406332) (← links)
- Coloring Hanoi and Sierpiński graphs (Q411656) (← links)
- Diameters, distortion, and eigenvalues (Q444413) (← links)
- Twin towers of Hanoi (Q444425) (← links)
- Growth of Schreier graphs of automaton groups. (Q453409) (← links)
- The number of moves of the largest disc in shortest paths on Hanoi graphs (Q490248) (← links)
- Coloring the square of Sierpiński graphs (Q497382) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- Enumeration of matchings in families of self-similar graphs (Q608260) (← links)
- Resistance scaling and the number of spanning trees in self-similar lattices (Q633130) (← links)
- Some topics in the dynamics of group actions on rooted trees. (Q641942) (← links)
- On the planarity of Hanoi graphs (Q699008) (← links)
- A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles (Q730903) (← links)
- Shortest paths in Sierpiński graphs (Q741754) (← links)
- Hanoi graphs and some classical numbers (Q813952) (← links)
- The diameter of Hanoi graphs (Q844161) (← links)
- Enumerating submultisets of multisets (Q1007533) (← links)
- An iterative algorithm for the Tower of Hanoi with four pegs (Q1119589) (← links)
- Shortest paths between regular states of the Tower of Hanoi (Q1193833) (← links)
- The average distance on the Sierpiński gasket (Q1263889) (← links)
- The generalized Towers of Hanoi for space-deficient computers and forgetful humans (Q1272420) (← links)
- Four encounters with Sierpiński's gasket (Q1343282) (← links)
- Complexity of Toeplitz sequences (Q1382825) (← links)
- Power domination in Knödel graphs and Hanoi graphs (Q1692626) (← links)
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence (Q1775033) (← links)
- The average eccentricity of Sierpiński graphs (Q1926020) (← links)
- The linear \(t\)-colorings of Sierpiński-like graphs (Q2014728) (← links)
- The \((d, 1)\)-total labelling of Sierpiński-like graphs (Q2279623) (← links)
- Distances in Sierpiński graphs and on the Sierpiński gasket (Q2375905) (← links)
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem (Q4209980) (← links)
- ECCENTRIC DISTANCE SUM OF SIERPIŃSKI GASKET AND SIERPIŃSKI NETWORK (Q4961151) (← links)
- Recognizing generalized Sierpiński graphs (Q4988984) (← links)
- Enumeration of maximum matchings in the Hanoi graphs using matching polynomials (Q6059080) (← links)
- Random walks on dual Sierpinski gaskets (Q6176639) (← links)
