Broadcast chromatic numbers of graphs

MaRDI QIDQ3070232zbMATH OpenFDO

Authors Wayne Goddard, Sandra M. Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall

Publication date 2 February 2011

zbMATH Keywords

treesquare gridpacking colouringbroadcast colouring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• The \(S\)-packing chromatic number of a graph
• Complexity of the Packing Coloring Problem for Trees
• Polynomial instances of the packing coloring problem
• Modeling the packing coloring problem of graphs
• Complexity of the packing coloring problem for trees

Cited in

(77)

• Packing colorings of subcubic outerplanar graphs
• An infinite family of subcubic graphs with unbounded packing chromatic number
• The packing chromatic number of hypercubes
• A characterization of 4-\(\chi_S\)-vertex-critical graphs for packing sequences with \(s_1 = 1\) and \(s_2 \geq 3\)
• Between Proper and Strong Edge-Colorings of Subcubic Graphs
• A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices
• Facial packing vertex-coloring of subdivided plane graphs
• A survey on packing colorings
• Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• Packing chromatic number of certain fan and wheel related graphs
• Complexity of the Packing Coloring Problem for Trees
• On the \(k\)-independence number of graphs
• Packing chromatic number versus chromatic and clique number
• \(S\)-packing chromatic vertex-critical graphs
• \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\)
• Packing coloring of Sierpiński-type graphs
• A lower bound for the packing chromatic number of the Cartesian product of cycles
• The \(k\)-independence number of \(t\)-connected graphs
• On \(S\)-packing edge-colorings of cubic graphs
• Packing chromatic number of subdivisions of cubic graphs
• A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number
• A note on \(S\)-packing colorings of lattices
• Packing chromatic number of distance graphs
• On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• On packing coloring of helm related graphs
• Between proper and strong edge‐colorings of subcubic graphs
• On the packing chromatic number of Moore graphs
• On the packing chromatic number of subcubic outerplanar graphs
• The packing coloring problem for lobsters and partner limited graphs
• A survey and classification of Sierpiński-type graphs
• \((d, n)\)-packing colorings of infinite lattices
• Facial packing edge-coloring of plane graphs
• A new approach on locally checkable problems
• Complexity of the packing coloring problem for trees
• Notes on complexity of packing coloring
• Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree
• \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
• The packing coloring of distance graphs \(D(k,t)\)
• Modeling the packing coloring problem of graphs
• Spectral bounds for the \(k\)-independence number of a graph
• On packing colorings of distance graphs
• Packing chromatic number of base-3 Sierpiński graphs
• Polynomial instances of the packing coloring problem
• The packing chromatic number of the infinite square lattice is between 13 and 15
• Packing coloring of some undirected and oriented coronae graphs
• On the packing chromatic number of some lattices
• Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph
• scientific article; zbMATH DE number 7651226 (Why is no real title available?)
• Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction
• Packing chromatic number under local changes in a graph
• Dichotomies properties on computational complexity of \(S\)-packing coloring problems
• \(S\)-packing colorings of cubic graphs
• The packing chromatic number of infinite product graphs
• Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
• Packing colouring of some classes of cubic graphs
• Graphs that are critical for the packing chromatic number
• Packing chromatic number of cubic graphs
• On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs
• Packing chromatic number of windmill related graphs and chain silicate networks
• The optimal bound on the 3-independence number obtainable from a polynomial-type method
• Radio labeling of certain networks
• Independence, matching and packing coloring of the iterated Mycielskian of graphs
• The exponential growth of the packing chromatic number of iterated Mycielskians
• A study on packing coloring of fan and jump graph families
• On \(S\)-packing coloring of 2-saturated subcubic graphs
• Partial packing coloring and quasi-packing coloring of the triangular grid
• About \(S\)-packing coloring of subcubic graphs
• Packing chromatic numbers of finite super subdivisions of graphs
• Independence number and packing coloring of generalized Mycielski graphs
• The packing chromatic number of the infinite square grid is 15
• A note on the packing chromatic number of lexicographic products
• On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\)
• On uniquely packable trees
• About \(S\)-packing coloring of 3-irregular subcubic graphs
• Packing coloring of hypercubes with extended Hamming codes

This page was built for publication: Broadcast chromatic numbers of graphs

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