Broadcast chromatic numbers of graphs
From MaRDI portal
Publication:3070232
zbMATH Open1224.05172MaRDI QIDQ3070232FDOQ3070232
Authors: Wayne Goddard, Sandra M. Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall 
Publication date: 2 February 2011
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Cited In (77)
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number
- Packing chromatic number of base-3 Sierpiński graphs
- Title not available (Why is that?)
- A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices
- Facial packing vertex-coloring of subdivided plane graphs
- A survey and classification of Sierpiński-type graphs
- A lower bound for the packing chromatic number of the Cartesian product of cycles
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- Modeling the packing coloring problem of graphs
- Packing colouring of some classes of cubic graphs
- On the packing chromatic number of Moore graphs
- Notes on complexity of packing coloring
- A new approach on locally checkable problems
- The packing coloring problem for lobsters and partner limited graphs
- \(S\)-packing colorings of cubic graphs
- An infinite family of subcubic graphs with unbounded packing chromatic number
- The \(k\)-independence number of \(t\)-connected graphs
- Packing chromatic number versus chromatic and clique number
- \((d, n)\)-packing colorings of infinite lattices
- A survey on packing colorings
- On the \(k\)-independence number of graphs
- \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\)
- On packing coloring of helm related graphs
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- Facial packing edge-coloring of plane 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
- Graphs that are critical for the packing chromatic number
- Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs
- Polynomial instances of the packing coloring problem
- Packing coloring of Sierpiński-type graphs
- On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs
- On packing colorings of distance graphs
- Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree
- Packing chromatic number of cubic graphs
- 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
- On \(S\)-packing edge-colorings of cubic graphs
- Packing chromatic number of subdivisions of cubic graphs
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
- Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
- Packing colorings of subcubic outerplanar graphs
- On the packing chromatic number of subcubic outerplanar graphs
- Between proper and strong edge‐colorings of subcubic graphs
- Spectral bounds for the \(k\)-independence number of a graph
- Dichotomies properties on computational complexity of \(S\)-packing coloring problems
- A note on \(S\)-packing colorings of lattices
- Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph
- Packing chromatic number under local changes in a graph
- \(S\)-packing chromatic vertex-critical graphs
- The packing coloring of distance graphs \(D(k,t)\)
- Packing coloring of some undirected and oriented coronae graphs
- Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction
- Packing chromatic number of certain fan and wheel related graphs
- The packing chromatic number of hypercubes
- Complexity of the Packing Coloring Problem for Trees
- The packing chromatic number of the infinite square lattice is between 13 and 15
- The optimal bound on the 3-independence number obtainable from a polynomial-type method
- On uniquely packable trees
- Packing chromatic number of windmill related graphs and chain silicate networks
- Radio labeling of certain networks
- The exponential growth of the packing chromatic number of iterated Mycielskians
- Independence number and packing coloring of generalized Mycielski graphs
- A note on the packing chromatic number of lexicographic products
- Packing coloring of hypercubes with extended Hamming codes
- About \(S\)-packing coloring of 3-irregular subcubic graphs
- About \(S\)-packing coloring of subcubic graphs
- On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs
- On \(S\)-packing coloring of 2-saturated subcubic graphs
- Partial packing coloring and quasi-packing coloring of the triangular grid
- Independence, matching and packing coloring of the iterated Mycielskian of graphs
- The packing chromatic number of the infinite square grid is 15
- On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\)
- Title not available (Why is that?)
- Packing chromatic numbers of finite super subdivisions of graphs
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)
