Coloring Hanoi and Sierpiński graphs
From MaRDI portal
Publication:411656
DOI10.1016/j.disc.2011.08.019zbMath1239.05066OpenAlexW1964946879MaRDI QIDQ411656
Daniele Parisse, Andreas M. Hinz
Publication date: 30 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.08.019
Related Items
Anti-Ramsey number of Hanoi graphs ⋮ Sierpiński graphs as spanning subgraphs of Hanoi graphs ⋮ On total coloring of some classes of regular graphs ⋮ The average eccentricity of Sierpiński graphs ⋮ Open problems for Hanoi and Sierpiński graphs ⋮ The Hanoi graph \(H_4^3\) ⋮ Total colorings-a survey ⋮ Total coloring conjecture on certain classes of product graphs ⋮ Finding the edge ranking number through vertex partitions ⋮ The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs ⋮ Metric properties of Sierpiński-like graphs ⋮ The number of moves of the largest disc in shortest paths on Hanoi graphs ⋮ Coloring the square of Sierpiński graphs ⋮ The Wiener index of Sierpiński-like graphs ⋮ Computation of Zagreb indices and Zagreb polynomials of Sierpinski graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ Generalized power domination: propagation radius and Sierpiński graphs ⋮ The linear \(t\)-colorings of Sierpiński-like graphs ⋮ Structural properties of subdivided-line graphs ⋮ The \((d, 1)\)-total labelling of Sierpiński-like graphs ⋮ Shortest paths in Sierpiński graphs ⋮ Degree sequence of the generalized Sierpiński graph ⋮ On some bounds of the topological indices of generalized Sierpiński and extended Sierpiński graphs ⋮ Irregular colorings of certain classes of corona product and Sierpiński graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the planarity of Hanoi graphs
- Coloring Sierpiński graphs and Sierpiński gasket graphs
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
- The average distance on the Sierpiński gasket
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
- Error-correcting codes on the Towers of Hanoi graphs
- The tower of Hanoi
- Total colourings of graphs
- The average eccentricity of Sierpiński graphs
- Codes and \(L(2,1)\)-labelings in Sierpiński graphs
- Coloring and Counting on the Tower of Hanoi Graphs
- Linear-time disk-based implicit graph search
- The Mathematical Coloring Book
- A statistical analysis of the towers of hanoi problem
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- 1-perfect codes in Sierpiński graphs
- Crossing numbers of Sierpiński‐like graphs
- Shortest Paths in the Tower of Hanoi Graph and Finite Automata
