Open problems for Hanoi and Sierpiński graphs (Q2413332): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2017.10.058
+Normal rank
@@ Property / OpenAlex ID @@
+W2774066560
@@ Property / OpenAlex ID: W2774066560 / rank @@
+Normal rank
@@ Property / cites work @@
+The number of moves of the largest disc in shortest paths on Hanoi graphs
+Normal rank
@@ Property / cites work @@
+The fourth tower of Hanoi
@@ Property / cites work: The fourth tower of Hanoi / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm to determine all shortest paths in Sierpiński graphs
+Normal rank
@@ Property / cites work @@
+The Tower of Hanoi – Myths and Maths
@@ Property / cites work: The Tower of Hanoi – Myths and Maths / rank @@
+Normal rank
@@ Property / cites work @@
+A survey and classification of Sierpiński-type graphs
+Normal rank
@@ Property / cites work @@
+Coloring Hanoi and Sierpiński graphs
@@ Property / cites work: Coloring Hanoi and Sierpiński graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The average eccentricity of Sierpiński graphs
@@ Property / cites work: The average eccentricity of Sierpiński graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computational solution of an old tower of Hanoi problem
+Normal rank