On the packing chromatic number of some lattices

DOI10.1016/j.dam.2009.06.001zbMath1221.05137OpenAlexW2027444730MaRDI QIDQ987667

Douglas F. Rall, Arthur S. Finbow

Publication date: 13 August 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.06.001

zbMATH Keywords

triangular latticeinteger latticepacking chromatic number\(k\)-packing

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (30)

Packing coloring of some undirected and oriented coronae graphs ⋮ Packing coloring of Sierpiński-type 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 ⋮ A note on \(S\)-packing colorings of lattices ⋮ Packing chromatic number versus chromatic and clique number ⋮ Independence number and packing coloring of generalized Mycielski graphs ⋮ Packing chromatic numbers of finite super subdivisions of graphs ⋮ A note on the packing chromatic number of lexicographic products ⋮ Dichotomies properties on computational complexity of \(S\)-packing coloring problems ⋮ 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 ⋮ On packing colorings of distance graphs ⋮ On the packing chromatic number of Moore graphs ⋮ On the packing chromatic number of subcubic outerplanar graphs ⋮ Facial packing vertex-coloring of subdivided plane graphs ⋮ On \(S\)-packing edge-colorings of cubic graphs ⋮ Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph ⋮ The packing chromatic number of the infinite square lattice is between 13 and 15 ⋮ \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\) ⋮ The packing chromatic number of infinite product graphs ⋮ On \(S\)-packing edge-colorings of graphs with small edge weight ⋮ Polynomial instances of the Packing Coloring Problem ⋮ The packing chromatic number of hypercubes

Cites Work

• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• Unnamed Item
• Unnamed Item

This page was built for publication: On the packing chromatic number of some lattices