On the restricted Hanoi graphs

DOI10.26493/2590-9770.1641.F6DzbMATH Open1548.05035MaRDI QIDQ6629797FDOQ6629797

El-Mehdi Mehiri

Publication date: 30 October 2024

Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

enumerationHanoi graphstower of Hanoigraph generationrestricted Hanoi graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Exact enumeration problems, generating functions (05A15) Recreational mathematics (00A08)

Cites Work

• The Tower of Hanoi – Myths and Maths
• On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
• The cyclic towers of Hanoi
• The worst Hanoi graphs
• The Tower of Hanoi with Forbidden Moves
• On an infinite family of solvable Hanoi graphs
• The cyclic multi-peg Tower of Hanoi
• The tower of Hanoi problem on Path\(_h\) graphs
• Developments in Language Theory
• Hanoi graphs and some classical numbers
• The diameter of Hanoi graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Dudeney-Stockmeyer conjecture
• Mathematical recreations
• The weighted tower of Hanoi

This page was built for publication: On the restricted Hanoi graphs

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