On the planarity of Hanoi graphs
From MaRDI portal
Publication:699008
DOI10.1016/S0723-0869(02)80023-8zbMATH Open1008.05045OpenAlexW2049521475MaRDI QIDQ699008FDOQ699008
Daniele Parisse, Andreas M. Hinz
Publication date: 30 September 2002
Published in: Expositiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0723-0869(02)80023-8
Recommendations
- On planar hypohamiltonian graphs
- scientific article; zbMATH DE number 3859171
- scientific article; zbMATH DE number 1019602
- Extremal \(H\)-free planar graphs
- On almost-planar graphs
- scientific article; zbMATH DE number 475620
- On the complexity of \(H\)-colouring planar graphs
- The complexity of the Hajós calculus for planar graphs
- Planar hypohamiltonian oriented graphs
- On the planarity of cyclic graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- The average distance on the Sierpiński gasket
- Pascal's Triangle and the Tower of Hanoi
- Title not available (Why is that?)
- Title not available (Why is that?)
- The tower of Hanoi
- Error-correcting codes on the Towers of Hanoi graphs
- Title not available (Why is that?)
- Towers of hanoi graphs
- The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi)
- Title not available (Why is that?)
Cited In (22)
- A tour of general Hanoi graphs
- A survey and classification of Sierpiński-type graphs
- Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph
- Anti-Ramsey number of Hanoi graphs
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
- Hanoi graphs and some classical numbers
- Shortest paths in Sierpiński graphs
- Hanani-Tutte for Radial Planarity II
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
- The \((d, 1)\)-total labelling of Sierpiński-like graphs
- The Hanoi graph \(H_4^3\)
- The weighted tower of Hanoi
- Title not available (Why is that?)
- Hanani-Tutte for Radial Planarity
- Sierpiński graphs as spanning subgraphs of Hanoi graphs
- Hanani-Tutte for radial planarity. II
- Hanani-Tutte for Radial Planarity
- Feedback vertex number of Sierpiński-type graphs
- Coloring Hanoi and Sierpiński graphs
- A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles
- The linear \(t\)-colorings of Sierpiński-like graphs
- Coloring the square of Sierpiński graphs
This page was built for publication: On the planarity of Hanoi graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q699008)
