scientific article
From MaRDI portal
Publication:3070232
zbMath1224.05172MaRDI QIDQ3070232
Wayne Goddard, Sandra M. Hedetniemi, John M. Harris, Douglas F. Rall, Stephen T. Hedetniemi
Publication date: 2 February 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Related Items (68)
On packing coloring of helm related graphs ⋮ Packing coloring of some undirected and oriented coronae graphs ⋮ Packing coloring of Sierpiński-type graphs ⋮ A new approach on locally checkable problems ⋮ Between Proper and Strong Edge-Colorings of Subcubic Graphs ⋮ \(S\)-packing colorings of cubic graphs ⋮ Packing chromatic number of base-3 Sierpiński graphs ⋮ An infinite family of subcubic graphs with unbounded packing chromatic number ⋮ Facial packing edge-coloring of plane graphs ⋮ Notes on complexity of packing coloring ⋮ A note on \(S\)-packing colorings of lattices ⋮ Complexity of the Packing Coloring Problem for Trees ⋮ Packing chromatic number versus chromatic and clique number ⋮ 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 ⋮ Packing chromatic numbers of finite super subdivisions of graphs ⋮ A note on the packing chromatic number of lexicographic products ⋮ On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs ⋮ Dichotomies properties on computational complexity of \(S\)-packing coloring problems ⋮ Packing chromatic number of certain fan and wheel related graphs ⋮ The optimal bound on the 3-independence number obtainable from a polynomial-type method ⋮ Packing chromatic number of cubic graphs ⋮ Between proper and strong edge‐colorings of subcubic graphs ⋮ Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction ⋮ The exponential growth of the packing chromatic number of iterated Mycielskians ⋮ On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs ⋮ Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs ⋮ Packing chromatic number of distance 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 ⋮ Unnamed Item ⋮ A characterization of 4-\(\chi_S\)-vertex-critical graphs for packing sequences with \(s_1 = 1\) and \(s_2 \geq 3\) ⋮ Packing colorings of subcubic outerplanar graphs ⋮ About \(S\)-packing coloring of subcubic graphs ⋮ \((d, n)\)-packing colorings of infinite lattices ⋮ On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\) ⋮ A lower bound for the packing chromatic number of the Cartesian product of cycles ⋮ The packing coloring of distance graphs \(D(k,t)\) ⋮ On packing colorings of distance graphs ⋮ On the packing chromatic number of Moore graphs ⋮ The packing coloring problem for lobsters and partner limited graphs ⋮ 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 ⋮ Spectral bounds for the \(k\)-independence number of a graph ⋮ Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph ⋮ The \(k\)-independence number of \(t\)-connected graphs ⋮ 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 ⋮ Unnamed Item ⋮ Modeling the packing coloring problem of graphs ⋮ Complexity of the packing coloring problem for trees ⋮ On the packing chromatic number of some lattices ⋮ \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\) ⋮ On the packing chromatic number of Cartesian products, hexagonal lattice, and trees ⋮ Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs ⋮ On the packing chromatic number of Cartesian products, hexagonal lattice, and trees ⋮ Packing colouring of some classes of cubic graphs ⋮ The packing chromatic number of infinite product graphs ⋮ \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited ⋮ On the \(k\)-independence number of graphs ⋮ Polynomial instances of the Packing Coloring Problem ⋮ The packing chromatic number of hypercubes ⋮ Graphs that are critical for the packing chromatic number
This page was built for publication:
