scientific article; zbMATH DE number 1488860
From MaRDI portal
Publication:4495694
zbMATH Open0955.05010MaRDI QIDQ4495694FDOQ4495694
Authors: Andreas M. Hinz
Publication date: 21 November 2000
Title of this publication is not available (Why is that?)
Recommendations
shortest pathstate graphcombinatorial functionsHanoi graphTower of HanoiStern-Brocot arraySierpiński gasketSierpiński trianglesquare-free sequencesPascal's arithmetrical triangle
Cited In (24)
- A cornucopia of connections: finding four familiar fractals in the tower of Hanoi
- FLIPPING COINS, FOLDING PAPER, AND FINDING FAMILIAR FRACTALS IN THE TOWER OF HANOI
- Pascal's Triangle and the Tower of Hanoi
- Title not available (Why is that?)
- Breadth-first heuristic search
- Shortest Paths in the Tower of Hanoi Graph and Finite Automata
- Title not available (Why is that?)
- The average eccentricity of Sierpiński graphs
- Hanoi graphs and some classical numbers
- Shortest paths in Sierpiński graphs
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
- The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
- The \((d, 1)\)-total labelling of Sierpiński-like graphs
- New variations on the tower of Hanoi
- Discovering Fibonacci numbers, Fibonacci words, and a Fibonacci fractal in the tower of Hanoi
- Marcel Frémiot, determinism versus chaos, and the tower of Hanoi
- The Solution to a Hanoi-ing Little Problem
- The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
- Title not available (Why is that?)
- On the planarity of Hanoi graphs
- Some properties of the generalized Sierpiński gasket graphs
- Coloring Hanoi and Sierpiński graphs
- The linear \(t\)-colorings of Sierpiński-like graphs
- Coloring the square of Sierpiński graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4495694)