Coloring and Counting on the Tower of Hanoi Graphs
From MaRDI portal
Publication:3103372
DOI10.4169/002557010X494841zbMath1227.05140WikidataQ56687220 ScholiaQ56687220MaRDI QIDQ3103372
Publication date: 7 December 2011
Published in: Mathematics Magazine (Search for Journal in Brave)
Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Combinatorics (educational aspects) (97K20)
Related Items (8)
Anti-Ramsey number of Hanoi graphs ⋮ Sierpiński graphs as spanning subgraphs of Hanoi graphs ⋮ Coloring Hanoi and Sierpiński graphs ⋮ Coloring the square of Sierpiński graphs ⋮ The linear \(t\)-colorings of Sierpiński-like graphs ⋮ The \((d, 1)\)-total labelling of Sierpiński-like graphs ⋮ Shortest paths in Sierpiński graphs ⋮ On the treewidth of Hanoi graphs
This page was built for publication: Coloring and Counting on the Tower of Hanoi Graphs
