Publication:4495694
From MaRDI portal
zbMath0955.05010MaRDI QIDQ4495694
Publication date: 21 November 2000
shortest path; Sierpiński gasket; state graph; combinatorial functions; Hanoi graph; Tower of Hanoi; Sierpiński triangle; Stern-Brocot array; square-free sequences; Pascal's arithmetrical triangle
05A99: Enumerative combinatorics
Related Items
Coloring Hanoi and Sierpiński graphs, Coloring the square of Sierpiński graphs, On the planarity of Hanoi graphs, Shortest paths in Sierpiński graphs, Hanoi graphs and some classical numbers, Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence, The average eccentricity of Sierpiński graphs, The linear \(t\)-colorings of Sierpiński-like graphs, The \((d, 1)\)-total labelling of Sierpiński-like graphs, Breadth-first heuristic search