Vertex-, edge-, and total-colorings of Sierpiński-like graphs

DOI10.1016/j.disc.2008.02.026zbMath1198.05056OpenAlexW1988724208MaRDI QIDQ1024467

Marko Jakovac, Sandi Klavžar

Publication date: 17 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.02.026

zbMATH Keywords

chromatic numberchromatic indextotal chromatic numberSierpiński graphsSierpiński gasket graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (27)

Packing coloring of Sierpiński-type graphs ⋮ Sierpiński products of r-uniform hypergraphs ⋮ Distances in Sierpiński graphs and on the Sierpiński gasket ⋮ The Sierpiński product of graphs ⋮ New results on variants of covering codes in Sierpiński graphs ⋮ Global strong defensive alliances of Sierpiński-like graphs ⋮ On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs ⋮ The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs ⋮ The average eccentricity of Sierpiński graphs ⋮ Coloring Hanoi and Sierpiński graphs ⋮ Total colorings-a survey ⋮ Finding the edge ranking number through vertex partitions ⋮ The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs ⋮ The hub number of Sierpiński-like graphs ⋮ Metric properties of Sierpiński-like graphs ⋮ Coloring the square of Sierpiński graphs ⋮ The Wiener index of Sierpiński-like graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ Unnamed Item ⋮ The linear \(t\)-colorings of Sierpiński-like graphs ⋮ On total chromatic number of direct product graphs ⋮ Structural properties of subdivided-line graphs ⋮ The \((d, 1)\)-total labelling of Sierpiński-like graphs ⋮ Shortest paths in Sierpiński graphs ⋮ Irregular colorings of certain classes of corona product and Sierpiński graphs ⋮ Feedback vertex number of Sierpiński-type graphs ⋮ The outer-connected domination number of Sierpiński-like graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the planarity of Hanoi graphs
• Hanoi graphs and some classical numbers
• The diameter of Hanoi graphs
• A result on the total colouring of powers of cycles
• Coloring Sierpiński graphs and Sierpiński gasket graphs
• The average distance on the Sierpiński gasket
• Behzad-Vizing conjecture and Cartesian-product graphs
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• Total colourings of graphs
• A trace theorem for the Dirichlet form on the Sierpinski gasket
• Codes and \(L(2,1)\)-labelings in Sierpiński graphs
• Lipscomb's L(A) Space Fractalized in Hilbert's l 2 (A) Space
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• Crossing numbers of Sierpiński‐like graphs
• Shortest Paths in the Tower of Hanoi Graph and Finite Automata

This page was built for publication: Vertex-, edge-, and total-colorings of Sierpiński-like graphs