Recommendations
Cited in
(92)- The packing chromatic number of infinite product graphs
- Packing coloring of Sierpiński-type graphs
- An infinite family of subcubic graphs with unbounded packing chromatic number
- Notes on complexity of packing coloring
- Packing chromatic number versus chromatic and clique number
- Packing chromatic number of cubic graphs
- (d, n)-packing colorings of infinite lattices
- On the packing chromatic number of subcubic outerplanar graphs
- Facial packing vertex-coloring of subdivided plane graphs
- 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
- A lower bound for the packing chromatic number of the Cartesian product of cycles
- Modeling the packing coloring problem of graphs
- \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\)
- Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
- Graphs that are critical for the packing chromatic number
- A new approach on locally checkable problems
- Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
- A survey on packing colorings
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number
- \(S\)-packing chromatic vertex-critical graphs
- Packing colorings of subcubic outerplanar graphs
- On the packing chromatic number of Moore graphs
- The \(k\)-independence number of \(t\)-connected graphs
- On the \(k\)-independence number of graphs
- The packing chromatic number of hypercubes
- Packing coloring of some undirected and oriented coronae graphs
- Dichotomies properties on computational complexity of S-packing coloring problems
- Packing chromatic number of certain fan and wheel related graphs
- Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction
- 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
- Packing chromatic number of base-3 Sierpiński graphs
- A note on \(S\)-packing colorings of lattices
- Independence number and packing coloring of generalized Mycielski graphs
- Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree
- A note on the packing chromatic number of lexicographic products
- On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs
- On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\)
- Polynomial instances of the packing coloring problem
- \(S\)-packing colorings of cubic graphs
- Facial packing edge-coloring of plane graphs
- On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs
- Packing chromatic number of distance graphs
- Packing colouring of some classes of cubic graphs
- Spectral bounds for the \(k\)-independence number of a graph
- On packing coloring of helm related graphs
- Between Proper and Strong Edge-Colorings of Subcubic Graphs
- A study on packing coloring of fan and jump graph families
- Packing chromatic numbers of finite super subdivisions of 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
- The packing chromatic number of the infinite square lattice is between 13 and 15
- Complexity of the Packing Coloring Problem for Trees
- scientific article; zbMATH DE number 7651226 (Why is no real title available?)
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- The optimal bound on the 3-independence number obtainable from a polynomial-type method
- Between proper and strong edge‐colorings of subcubic graphs
- The exponential growth of the packing chromatic number of iterated Mycielskians
- A characterization of 4-_S-vertex-critical graphs for packing sequences with s₁ = 1 and s₂ 3
- About S-packing coloring of subcubic graphs
- The packing chromatic number of the infinite square grid is 15
- On uniquely packable trees
- Packing chromatic number of windmill related graphs and chain silicate networks
- Radio labeling of certain networks
- About \(S\)-packing coloring of 3-irregular subcubic graphs
- Packing coloring of hypercubes with extended Hamming codes
- 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
- S-packing chromatic critical graphs
- Bounds for packing chromatic number of some subclasses of trees
- On the (1, 2⁵)-packing edge-colorings of claw-free subcubic graphs
- On S-packing colorings of subcubic graphs
- (s,s+1,s+1,)-packing colorings and (1,s,s,)-packing colorings and d-distance colorings of distance graphs D(1,t)
- Algebraic and combinatorial algorithms for S-packing coloring
- Every subcubic graph is packing (1,1,2,2,3)-colorable
- Claw-free cubic graphs are (1,1,2,2)-colorable
- Grundy packing coloring of graphs
- Distance dominator packing coloring of type II
- S-packing colorings of distance graphs with distance sets of cardinality 2
- Further results and questions on S-packing coloring of subcubic graphs
- Fast algorithm for S-packing coloring of Halin graphs
- On the (1, 1, 2, 3)-packing coloring of some subcubic graphs
- On the packing chromatic numbers of four and five regular connected spanning subgraphs of \(\mathbb{Z}^3\)
- Complexity of the packing coloring problem for trees
- On the packing chromatic number of some lattices
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)
