Coloring Hanoi and Sierpiński graphs

DOI10.1016/J.DISC.2011.08.019MaRDI QIDQ411656zbMATH OpenOpenAlexFDO

Authors Andreas M. Hinz, Daniele Parisse

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

zbMATH Keywords

edge-coloringHanoi graphstotal coloringplanarityvertex-coloringSierpiński graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Coloring Sierpiński graphs and Sierpiński gasket graphs
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs
• Total coloring for generalized Sierpiński graphs
• On \(r\)-hued colorings of Sierpiński graphs and Sierpiński gasket graphs
• \(\{P_r\}\)-free colorings of Sierpiński-like graphs.

Cites work

• scientific article; zbMATH DE number 4065006 (Why is no real title available?)
• scientific article; zbMATH DE number 1488860 (Why is no real title available?)
• scientific article; zbMATH DE number 1439478 (Why is no real title available?)
• 1-perfect codes in Sierpiński graphs
• A statistical analysis of the towers of hanoi problem
• Codes and \(L(2,1)\)-labelings in Sierpiński graphs
• Coloring Sierpiński graphs and Sierpiński gasket graphs
• Coloring and counting on the tower of Hanoi graphs
• Crossing numbers of Sierpiński‐like graphs
• Error-correcting codes on the Towers of Hanoi graphs
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• Linear-time disk-based implicit graph search
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• On some metric properties of the Sierpiński graphs \(S(n,k)\)
• On the planarity of Hanoi graphs
• Shortest Paths in the Tower of Hanoi Graph and Finite Automata
• The Mathematical Coloring Book
• The average distance on the Sierpiński gasket
• The average eccentricity of Sierpiński graphs
• The tower of Hanoi
• Topics in graph theory. Graphs and their Cartesian product
• Total colourings of graphs
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs

Cited in

(29)

• The number of moves of the largest disc in shortest paths on Hanoi graphs
• Total colorings-a survey
• Structural properties of subdivided-line graphs
• Sierpiński graphs as spanning subgraphs of Hanoi graphs
• Computation of Zagreb indices and Zagreb polynomials of Sierpinski graphs
• Finding the edge ranking number through vertex partitions
• Metric properties of Sierpiński-like graphs
• Degree sequence of the generalized Sierpiński graph
• Shortest paths in Sierpiński graphs
• Total coloring conjecture on certain classes of product graphs
• Anti-Ramsey number of Hanoi graphs
• On some bounds of the topological indices of generalized Sierpiński and extended Sierpiński graphs
• On \(r\)-hued colorings of Sierpiński graphs and Sierpiński gasket graphs
• The average eccentricity of Sierpiński graphs
• Properties of Sierpinski triangle graphs
• Total coloring for generalized Sierpiński graphs
• Irregular colorings of certain classes of corona product and Sierpiński graphs
• The Hanoi graph \(H_4^3\)
• Coloring Sierpiński graphs and Sierpiński gasket graphs
• Generalized power domination: propagation radius and Sierpiński graphs
• The Wiener index of Sierpiński-like graphs
• A survey and classification of Sierpiński-type graphs
• The linear \(t\)-colorings of Sierpiński-like graphs
• Coloring the square of Sierpiński graphs
• The \((d, 1)\)-total labelling of Sierpiński-like graphs
• Open problems for Hanoi and Sierpiński graphs
• The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
• The weighted tower of Hanoi
• On total coloring of some classes of regular graphs

This page was built for publication: Coloring Hanoi and Sierpiński graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411656)