The diameter of Hanoi graphs
type: Item
instance of: scholarly article
title: The diameter of Hanoi graphs
zbMATH Open document ID: 1178.05089
author: Daniel Berend
author: Amir Sapir
published in: Information Processing Letters
publication date: 2010-01-18T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5659906
zbMATH Keywords: algorithms
zbMATH Keywords: graph algorithms
zbMATH Keywords: tower of Hanoi
zbMATH Keywords: directed graphs
zbMATH Keywords: graph diameter
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.12.004
OpenAlex ID: W2006916373
cites work: The cyclic towers of Hanoi
cites work: The cyclic multi-peg Tower of Hanoi
cites work: Q4949857
cites work: The complexity of the generalised cyclic Towers of Hanoi problem
cites work: The tower of Hanoi
cites work: On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
cites work: Q3758856
cites work: The Towers of Hanoi rainbow problem: Coloring the rings
cites work: The Tower of Hanoi with Forbidden Moves
cites work: Adjudicating a towers of hanoi contest†
DOI: 10.1016/J.IPL.2005.12.004
Recommended article: The diameter of directed graphs
Recommended article: Q2766678
Recommended article: The diameter of protean graphs
Recommended article: On the diameter of Kneser graphs
Recommended article: A generalisation of the diameter of a graph
Recommended article: Diameter of path graphs
Recommended article: The Diameter of a Graph and its Complement
Recommended article: Some properties of graphs of diameters
Recommended article: On the diameter of Kronecker graphs
Recommended article: On diameter of permutation graphs
description: scientific article; zbMATH DE number 5659906