Pascal's Triangle and the Tower of Hanoi
From MaRDI portal
Publication:5285734
DOI10.2307/2324061zbMATH Open0782.05003OpenAlexW2093851287WikidataQ56083802 ScholiaQ56083802MaRDI QIDQ5285734FDOQ5285734
Authors: Andreas M. Hinz
Publication date: 29 June 1993
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2324061
Recommendations
Combinatorics in computer science (68R05) Biographies, obituaries, personalia, bibliographies (01A70) Factorials, binomial coefficients, combinatorial functions (05A10) Graph theory (05C99)
Cited In (23)
- Metric properties of Sierpiński-like graphs
- A tour of general Hanoi graphs
- On a question of Leiss regarding the Hanoi Tower problem
- The Wiener index of Sierpiński-like graphs
- Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph
- Finding the edge ranking number through vertex partitions
- The tower of Hanoi problem on Path\(_h\) graphs
- The average eccentricity of Sierpiński graphs
- The outer-connected domination number of Sierpiński-like graphs
- Global strong defensive alliances of Sierpiński-like graphs
- The hub number of Sierpiński-like graphs
- Shortest paths in Sierpiński graphs
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
- The \((d, 1)\)-total labelling of Sierpiński-like graphs
- Title not available (Why is that?)
- The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs
- The weighted tower of Hanoi
- The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
- On the planarity of Hanoi graphs
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- The generalized four-peg tower of hanoi problem
- The linear \(t\)-colorings of Sierpiński-like graphs
- Coloring the square of Sierpiński graphs
This page was built for publication: Pascal's Triangle and the Tower of Hanoi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5285734)