Open problems for Hanoi and Sierpiński graphs

DOI10.1016/j.endm.2017.10.058zbMath1383.05079OpenAlexW2774066560MaRDI QIDQ2413332

Andreas M. Hinz

Publication date: 10 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.10.058

zbMATH Keywords

Sierpiński graphsHanoi graphsgraph distancegraph parameters

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (3)

The Dudeney-Stockmeyer conjecture ⋮ Metric properties of Sierpiński triangle graphs ⋮ The Hanoi graph \(H_4^3\)

Cites Work

• Computational solution of an old tower of Hanoi problem
• An efficient algorithm to determine all shortest paths in Sierpiński graphs
• Coloring Hanoi and Sierpiński graphs
• The number of moves of the largest disc in shortest paths on Hanoi graphs
• A survey and classification of Sierpiński-type graphs
• The average eccentricity of Sierpiński graphs
• The fourth tower of Hanoi
• The Tower of Hanoi – Myths and Maths

This page was built for publication: Open problems for Hanoi and Sierpiński graphs