The following pages link to The diameter of Hanoi graphs (Q844161):
Displaying 10 items.
- The tower of Hanoi problem on Path\(_h\) graphs (Q427887) (← links)
- Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes (Q476903) (← links)
- Shortest paths in Sierpiński graphs (Q741754) (← links)
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs (Q1024467) (← links)
- Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph (Q2202296) (← links)
- Exponential vs. Subexponential Tower of Hanoi Variants (Q2971384) (← links)
- A tour of general Hanoi graphs (Q6144016) (← links)
- On the treewidth of Hanoi graphs (Q6487581) (← links)
- How to do a half-turn in the cyclic tower of Hanoi (Q6614469) (← links)
- On the restricted Hanoi graphs (Q6629797) (← links)