Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Van Zanten, A. J.
1990.
The complexity of an optimal algorithm for the generalized tower of hanoi problem.
International Journal of Computer Mathematics,
Vol. 36,
Issue. 1-2,
p.
1.
Hinz, Andreas M.
and
Schief, Andreas
1990.
The average distance on the Sierpiński gasket.
Probability Theory and Related Fields,
Vol. 87,
Issue. 1,
p.
129.
Hinz, Andreas M.
1992.
Shortest paths between regular states of the Tower of Hanoi.
Information Sciences,
Vol. 63,
Issue. 1-2,
p.
173.
Allouche, Jean-Paul
Astoorian, Dan
Randall, Jim
and
Shallit, Jeffrey
1994.
Morphisms, Squarefree Strings, and the Tower of Hanoi Puzzle.
The American Mathematical Monthly,
Vol. 101,
Issue. 7,
p.
651.
Poole, David G.
1994.
The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi).
Mathematics Magazine,
Vol. 67,
Issue. 5,
p.
323.
Stewart, Ian
1995.
Four encounters with sierpińriski’s gasket.
The Mathematical Intelligencer,
Vol. 17,
Issue. 1,
p.
52.
Stockmeyer, Paul K.
Douglass Bateman, C.
Clark, James W.
Eyster, Cyrus R.
Harrison, Matthew T.
Loehr, Nicholas A.
Rodriguez, Patrick J.
and
Simmons, Joseph R.
1995.
Exchanging disks in the tower of hanoi.
International Journal of Computer Mathematics,
Vol. 59,
Issue. 1-2,
p.
37.
Li, Chi-Kwong
and
Nelson, Ingrid
1998.
Perfect codes on the towers of Hanoi graph.
Bulletin of the Australian Mathematical Society,
Vol. 57,
Issue. 3,
p.
367.
Hinz, Andreas M.
and
Parisse, Daniele
2002.
On the planarity of Hanoi graphs.
Expositiones Mathematicae,
Vol. 20,
Issue. 3,
p.
263.
Hinz, Andreas M.
Klavžar, Sandi
Milutinović, Uroš
Parisse, Daniele
and
Petr, Ciril
2005.
Metric properties of the Tower of Hanoi graphs and Stern’s diatomic sequence.
European Journal of Combinatorics,
Vol. 26,
Issue. 5,
p.
693.
Klavžar, Sandi
Milutinović, Uroš
and
Petr, Ciril
2005.
Hanoi graphs and some classical numbers.
Expositiones Mathematicae,
Vol. 23,
Issue. 4,
p.
371.
Allouche, Jean-Paul
and
Sapir, Amir
2005.
Developments in Language Theory.
Vol. 3572,
Issue. ,
p.
1.
Berend, Daniel
and
Sapir, Amir
2006.
The diameter of Hanoi graphs.
Information Processing Letters,
Vol. 98,
Issue. 2,
p.
79.
Berend, Daniel
and
Sapir, Amir
2006.
The cyclic multi-peg Tower of Hanoi.
ACM Transactions on Algorithms,
Vol. 2,
Issue. 3,
p.
297.
Azriel, Dany
Solomon, Noam
and
Solomon, Shay
2008.
On an infinite family of solvable Hanoi graphs.
ACM Transactions on Algorithms,
Vol. 5,
Issue. 1,
p.
1.
Jakovac, Marko
and
Klavžar, Sandi
2009.
Vertex-, edge-, and total-colorings of Sierpiński-like graphs.
Discrete Mathematics,
Vol. 309,
Issue. 6,
p.
1548.
Arett, Danielle
and
Dorée, Suzanne
2010.
Coloring and Counting on the Tower of Hanoi Graphs.
Mathematics Magazine,
Vol. 83,
Issue. 3,
p.
200.
Berend, Daniel
Sapir, Amir
and
Solomon, Shay
2012.
The Tower of Hanoi problem on Pathh graphs.
Discrete Applied Mathematics,
Vol. 160,
Issue. 10-11,
p.
1465.
Hinz, Andreas M.
and
Parisse, Daniele
2012.
Coloring Hanoi and Sierpiński graphs.
Discrete Mathematics,
Vol. 312,
Issue. 9,
p.
1521.
Berend, Daniel
and
Sapir, Amir
2012.
Graph-Theoretic Concepts in Computer Science.
Vol. 7551,
Issue. ,
p.
81.