AbstractThe Hanoi graphs Hpn model the p-pegs n-discs Tower of Hanoi problem(s). It was previously known that Stirling numbers of the second kind and Stern's diatomic sequence appear naturally in the graphs Hpn. In this note, second-order Eulerian numbers and Lah numbers are added to this list. Considering a variant of the p-pegs n-discs problem, Catalan numbers are also encountered
summary:For any $n\ge 1$ and any $k\ge 1$, a graph $S(n,k)$ is introduced. Vertices of $S(n,k)$ are ...
Hanojski grafi $H_p^n$, $n geq 1$, $p geq 3$, so modeli predstavitve problema Hanojskega stolpa z $n...
The Tower of Hanoi puzzle was created over a century ago by the number theorist Edouard Lucas [2, 4]...
AbstractThe Hanoi graphs Hpn model the p-pegs n-discs Tower of Hanoi problem(s). It was previously k...
Combinatorial properties of the multi-peg Tower of Hanoi prob-lem on n discs and p pegs are studied....
AbstractThe generalized Tower of Hanoi problem with h≥4 pegs is known to require a sub-exponentially...
AbstractIt is known that in the Tower of Hanoi graphs there are at most two different shortest paths...
It is known that in the Tower of Hanoi graphs there are at most two different shortest paths between...
Combinatorial properties of the multipeg Tower of Hanoi problem on n discs and p pegs are studied T...
AbstractHanoi graphs are the state graphs for Tower of Hanoi problems with three or more pegs. We pr...
The Tower of Hanoi puzzle with its disks and poles is familiar to students in mathematics and comput...
Abstract. For the Tower of Hanoi problem, it has been found that it is possible to construct a nice ...
AbstractFor the multi-peg Tower of Hanoi problem with k≥4 pegs, so far the best solution is obtained...
Metric properties of Hanoi graphs Hnp are not as well understood as those of the closely related, bu...
AbstractThe Tower of Hanoi problem is generalized in such a way that the pegs are located at the ver...
summary:For any $n\ge 1$ and any $k\ge 1$, a graph $S(n,k)$ is introduced. Vertices of $S(n,k)$ are ...
Hanojski grafi $H_p^n$, $n geq 1$, $p geq 3$, so modeli predstavitve problema Hanojskega stolpa z $n...
The Tower of Hanoi puzzle was created over a century ago by the number theorist Edouard Lucas [2, 4]...
AbstractThe Hanoi graphs Hpn model the p-pegs n-discs Tower of Hanoi problem(s). It was previously k...
Combinatorial properties of the multi-peg Tower of Hanoi prob-lem on n discs and p pegs are studied....
AbstractThe generalized Tower of Hanoi problem with h≥4 pegs is known to require a sub-exponentially...
AbstractIt is known that in the Tower of Hanoi graphs there are at most two different shortest paths...
It is known that in the Tower of Hanoi graphs there are at most two different shortest paths between...
Combinatorial properties of the multipeg Tower of Hanoi problem on n discs and p pegs are studied T...
AbstractHanoi graphs are the state graphs for Tower of Hanoi problems with three or more pegs. We pr...
The Tower of Hanoi puzzle with its disks and poles is familiar to students in mathematics and comput...
Abstract. For the Tower of Hanoi problem, it has been found that it is possible to construct a nice ...
AbstractFor the multi-peg Tower of Hanoi problem with k≥4 pegs, so far the best solution is obtained...
Metric properties of Hanoi graphs Hnp are not as well understood as those of the closely related, bu...
AbstractThe Tower of Hanoi problem is generalized in such a way that the pegs are located at the ver...
summary:For any $n\ge 1$ and any $k\ge 1$, a graph $S(n,k)$ is introduced. Vertices of $S(n,k)$ are ...
Hanojski grafi $H_p^n$, $n geq 1$, $p geq 3$, so modeli predstavitve problema Hanojskega stolpa z $n...
The Tower of Hanoi puzzle was created over a century ago by the number theorist Edouard Lucas [2, 4]...
DOI
Add to ORKG