On the planarity of Hanoi graphs

DOI10.1016/S0723-0869(02)80023-8zbMath1008.05045OpenAlexW2049521475MaRDI QIDQ699008

Daniele Parisse, Andreas M. Hinz

Publication date: 30 September 2002

Published in: Expositiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0723-0869(02)80023-8

zbMATH Keywords

Hamiltonianplanar graphgame of Hanoi

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (17)

Anti-Ramsey number of Hanoi graphs ⋮ Sierpiński graphs as spanning subgraphs of Hanoi graphs ⋮ Coloring Hanoi and Sierpiński graphs ⋮ The Hanoi graph \(H_4^3\) ⋮ A tour of general Hanoi graphs ⋮ Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph ⋮ Coloring the square of Sierpiński graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ The linear \(t\)-colorings of Sierpiński-like graphs ⋮ Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence ⋮ The \((d, 1)\)-total labelling of Sierpiński-like graphs ⋮ A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles ⋮ The weighted tower of Hanoi ⋮ Shortest paths in Sierpiński graphs ⋮ Vertex-, edge-, and total-colorings of Sierpiński-like graphs ⋮ Feedback vertex number of Sierpiński-type graphs ⋮ Hanoi graphs and some classical numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The average distance on the Sierpiński gasket
• Error-correcting codes on the Towers of Hanoi graphs
• The tower of Hanoi
• Towers of hanoi graphs
• The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi)
• Pascal's Triangle and the Tower of Hanoi

This page was built for publication: On the planarity of Hanoi graphs