The S-packing chromatic number of a graph

DOI10.7151/dmgt.1642zbMath1293.05106OpenAlexW2042286951MaRDI QIDQ2866422

Wayne Goddard, Honghai Xu

Publication date: 13 December 2013

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1642

zbMATH Keywords

packingcoloringbroadcast 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 (26)

Packing coloring of Sierpiński-type graphs ⋮ Between Proper and Strong Edge-Colorings of Subcubic Graphs ⋮ \(S\)-packing colorings of cubic graphs ⋮ Packing chromatic number of base-3 Sierpiński graphs ⋮ A note on \(S\)-packing colorings of lattices ⋮ Packing chromatic number versus chromatic and clique number ⋮ Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph ⋮ On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs ⋮ Dichotomies properties on computational complexity of \(S\)-packing coloring problems ⋮ Between proper and strong edge‐colorings of subcubic graphs ⋮ Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs ⋮ A survey on packing colorings ⋮ On packing \(S\)-colorings of subcubic graphs ⋮ \(S\)-packing chromatic vertex-critical graphs ⋮ A characterization of 4-\(\chi_S\)-vertex-critical graphs for packing sequences with \(s_1 = 1\) and \(s_2 \geq 3\) ⋮ \((d, n)\)-packing colorings of infinite lattices ⋮ On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\) ⋮ A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices ⋮ 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 ⋮ A GENERAL POSITION PROBLEM IN GRAPH THEORY ⋮ \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\) ⋮ Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs ⋮ On \(S\)-packing edge-colorings of graphs with small edge weight ⋮ The packing chromatic number of hypercubes

This page was built for publication: The S-packing chromatic number of a graph