A note on packing chromatic number of the square lattice

zbMath1215.05050MaRDI QIDQ2380429

Roman Soukal, Přemysl Holub

Publication date: 26 March 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/225684

zbMATH Keywords

square latticepacking chromatic numberpacking colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items

Packing coloring of some undirected and oriented coronae graphs ⋮ \(S\)-packing colorings of cubic graphs ⋮ Packing chromatic number of base-3 Sierpiński graphs ⋮ Facial packing edge-coloring of plane graphs ⋮ Notes on complexity of packing coloring ⋮ A note on \(S\)-packing colorings of lattices ⋮ Independence number and packing coloring of generalized Mycielski graphs ⋮ Packing chromatic number of certain fan and wheel related graphs ⋮ Packing chromatic number of distance graphs ⋮ A survey on packing colorings ⋮ Packing colorings of subcubic outerplanar graphs ⋮ \((d, n)\)-packing colorings of infinite lattices ⋮ 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 subcubic outerplanar graphs ⋮ Facial packing vertex-coloring of subdivided plane graphs ⋮ A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices ⋮ The packing chromatic number of the infinite square lattice is between 13 and 15 ⋮ Modeling the packing coloring problem of graphs ⋮ \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\)