Packing chromatic number of base-3 Sierpiński graphs

DOI10.1007/s00373-015-1647-xzbMath1342.05111OpenAlexW2247215154MaRDI QIDQ2631074

Sandi Klavžar, Douglas F. Rall, Boštjan Brešar

Publication date: 28 July 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1647-x

zbMATH Keywords

packingSierpiński graphspacking chromatic number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (20)

Packing coloring of Sierpiński-type graphs ⋮ An infinite family of subcubic graphs with unbounded packing chromatic number ⋮ Packing chromatic number versus chromatic and clique number ⋮ Independence number and packing coloring of generalized Mycielski graphs ⋮ On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs ⋮ Packing chromatic number of cubic graphs ⋮ The exponential growth of the packing chromatic number of iterated Mycielskians ⋮ Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs ⋮ A survey on packing colorings ⋮ Packing colorings of subcubic outerplanar graphs ⋮ On the packing chromatic number of Moore graphs ⋮ On the packing chromatic number of subcubic outerplanar graphs ⋮ On \(S\)-packing edge-colorings of cubic graphs ⋮ Packing chromatic number of subdivisions of cubic graphs ⋮ Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph ⋮ Packing chromatic number under local changes in a graph ⋮ A survey and classification of Sierpiński-type graphs ⋮ Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs ⋮ Packing colouring of some classes of cubic graphs ⋮ On \(S\)-packing edge-colorings of graphs with small edge weight

Cites Work

• Unnamed Item
• Unnamed Item
• Global strong defensive alliances of Sierpiński-like graphs
• An efficient algorithm to determine all shortest paths in Sierpiński graphs
• Packing chromatic number of distance graphs
• Complexity of the packing coloring problem for trees
• On the packing chromatic number of some lattices
• The packing chromatic number of infinite product graphs
• On the packing chromatic number of subcubic outerplanar graphs
• The average eccentricity of Sierpiński graphs
• A lower bound for the packing chromatic number of the Cartesian product of cycles
• Modeling the packing coloring problem of graphs
• The linear \(t\)-colorings of Sierpiński-like graphs
• Generalized power domination: propagation radius and Sierpiński graphs
• The packing chromatic number of hypercubes
• A note on packing chromatic number of the square lattice
• New results on variants of covering codes in Sierpiński graphs
• Dichotomies properties on computational complexity of \(S\)-packing coloring problems
• The packing coloring of distance graphs \(D(k,t)\)
• On packing colorings of distance graphs
• The packing coloring problem for lobsters and partner limited graphs
• The S-packing chromatic number of a graph
• The Tower of Hanoi – Myths and Maths
• The Packing Coloring Problem for (q,q-4) Graphs
• On the packing chromatic number of square and hexagonal lattice
• Fractals and Universal Spaces in Dimension Theory
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• Shortest Paths in the Tower of Hanoi Graph and Finite Automata
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

This page was built for publication: Packing chromatic number of base-3 Sierpiński graphs