Pages that link to "Item:Q3815308"

The following pages link to A statistical analysis of the towers of hanoi problem (Q3815308):

Displaying 11 items.

• Coloring Hanoi and Sierpiński graphs (Q411656) (← links)
• Coloring the square of Sierpiński graphs (Q497382) (← links)
• Shortest paths in Sierpiński graphs (Q741754) (← links)
• Shortest paths between regular states of the Tower of Hanoi (Q1193833) (← links)
• The average distance on the Sierpiński gasket (Q1263889) (← links)
• Four encounters with Sierpiński's gasket (Q1343282) (← links)
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence (Q1775033) (← links)
• Parallelism for multipeg towers of Hanoi (Q1804221) (← links)
• The linear \(t\)-colorings of Sierpiński-like graphs (Q2014728) (← links)
• The \((d, 1)\)-total labelling of Sierpiński-like graphs (Q2279623) (← links)
• The complexity of an optimal algorithm for the generalized tower of hanoi problem (Q3479521) (← links)