Coloring Hanoi and Sierpiński graphs

DOI10.1016/J.DISC.2011.08.019zbMATH Open1239.05066OpenAlexW1964946879MaRDI QIDQ411656FDOQ411656

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

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.

zbMATH Keywords

edge-coloringHanoi graphstotal coloringplanarityvertex-coloringSierpiński graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• 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
• The average eccentricity of Sierpiński graphs
• Title not available (Why is that?)
• 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
• Coloring Sierpiński graphs and Sierpiński gasket graphs
• The Mathematical Coloring Book
• Total colourings of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The tower of Hanoi
• Coloring and Counting on the Tower of Hanoi Graphs
• On the planarity of Hanoi graphs
• Error-correcting codes on the Towers of Hanoi graphs
• Codes and \(L(2,1)\)-labelings in Sierpiński graphs
• Linear-time disk-based implicit graph search
• A statistical analysis of the towers of hanoi problem
• Title not available (Why is that?)

Cited In (25)

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