Coloring Hanoi and Sierpiński graphs
type: Item
instance of: scholarly article
title: Coloring Hanoi and Sierpiński graphs
zbMATH Open document ID: 1239.05066
author: Andreas M. Hinz
author: Daniele Parisse
published in: Discrete Mathematics
publication date: 2012-04-30T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6029001
zbMATH Keywords: Hanoi graphs
zbMATH Keywords: Sierpiński graphs
zbMATH Keywords: vertex-coloring
zbMATH Keywords: edge-coloring
zbMATH Keywords: total coloring
zbMATH Keywords: planarity
MaRDI profile type: Publication
full work available at URL: j.disc.2011.08.019
OpenAlex ID: W1964946879
cites work: Coloring and Counting on the Tower of Hanoi Graphs
cites work: Q4949857
cites work: A statistical analysis of the towers of hanoi problem
cites work: Error-correcting codes on the Towers of Hanoi graphs
cites work: Codes and \(L(2,1)\)-labelings in Sierpiński graphs
cites work: The tower of Hanoi
cites work: Q4495694
cites work: Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
cites work: On the planarity of Hanoi graphs
cites work: The average eccentricity of Sierpiński graphs
cites work: The average distance on the Sierpiński gasket
cites work: Q5302113
cites work: Vertex-, edge-, and total-colorings of Sierpiński-like graphs
cites work: Coloring Sierpiński graphs and Sierpiński gasket graphs
cites work: Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
cites work: 1-perfect codes in Sierpiński graphs
cites work: Crossing numbers of Sierpiński‐like graphs
cites work: Linear-time disk-based implicit graph search
cites work: Q3073555
cites work: Shortest Paths in the Tower of Hanoi Graph and Finite Automata
cites work: The Mathematical Coloring Book
cites work: Q3798668
cites work: Total colourings of graphs
DOI: 10.1016/J.DISC.2011.08.019
description: scientific article; zbMATH DE number 6029001