scientific article; zbMATH DE number 4008422

zbMATH Open0622.05029MaRDI QIDQ3758856FDOQ3758856

Authors: Ernst L. Leiss 

Publication date: 1983

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4025469
• The Generalized Towers of Hanoi Problem
• The worst Hanoi graphs
• On an infinite family of solvable Hanoi graphs
• scientific article; zbMATH DE number 3889555

zbMATH Keywords

finite graphsTowers of Hanoigeneral directed graphsgraph version

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Directed graphs (digraphs), tournaments (05C20)

Cited In (22)

• The worst Hanoi graphs
• On a question of Leiss regarding the Hanoi Tower problem
• The Generalized Towers of Hanoi Problem
• The tower of Hanoi problem on Path\(_h\) graphs
• Pour en finir avec la dérécursivation du problème des tours de Hanoï
• Title not available (Why is that?)
• The diameter of Hanoi graphs
• The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
• Twin towers of Hanoi
• Computational solution of an old tower of Hanoi problem
• Exponential vs. Subexponential Tower of Hanoi Variants
• Graphs, random walks, and the tower of Hanoi
• On the restricted Hanoi graphs
• The associativity of equivalence and the Towers of Hanoi problem
• The multiway trees of hanoi^†
• The worst parallel Hanoi graphs
• The Tower of Hanoi with Forbidden Moves
• Hamiltonianicity of the towers of Hanoi problem
• On an infinite family of solvable Hanoi graphs
• Towers of hanoi graphs
• Tours de Hanoï et automates
• Coloring and counting on the tower of Hanoi graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758856)