The following pages link to On the planarity of Hanoi graphs (Q699008):
Displaying 16 items.
- Sierpiński graphs as spanning subgraphs of Hanoi graphs (Q352716) (← links)
- Coloring Hanoi and Sierpiński graphs (Q411656) (← links)
- Coloring the square of Sierpiński graphs (Q497382) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles (Q730903) (← links)
- Shortest paths in Sierpiński graphs (Q741754) (← links)
- Hanoi graphs and some classical numbers (Q813952) (← links)
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs (Q1024467) (← links)
- Anti-Ramsey number of Hanoi graphs (Q1630944) (← links)
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence (Q1775033) (← links)
- The linear \(t\)-colorings of Sierpiński-like graphs (Q2014728) (← links)
- The Hanoi graph \(H_4^3\) (Q2194534) (← links)
- Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph (Q2202296) (← links)
- The \((d, 1)\)-total labelling of Sierpiński-like graphs (Q2279623) (← links)
- Feedback vertex number of Sierpiński-type graphs (Q3299375) (← links)
- A tour of general Hanoi graphs (Q6144016) (← links)
