On the packing chromatic number of some lattices

DOI10.1016/J.DAM.2009.06.001MaRDI QIDQ987667zbMATH OpenOpenAlexFDO

Authors Arthur S. Finbow, Douglas F. Rall

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

integer latticepacking chromatic numbertriangular lattice\(k\)-packing

Mathematics Subject Classification ID

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

Recommendations

• On the packing chromatic number of square and hexagonal lattice
• The packing chromatic number of hypercubes
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• A note on \(S\)-packing colorings of lattices
• On the chromatic numbers of integer and rational lattices
• Packing chromatic number of cubic graphs
• \((d, n)\)-packing colorings of infinite lattices
• scientific article; zbMATH DE number 7651226

Cites work

• scientific article; zbMATH DE number 2104737 (Why is no real title available?)
• Broadcast chromatic numbers of graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

Cited in

(44)

• Packing colorings of subcubic outerplanar graphs
• An infinite family of subcubic graphs with unbounded packing chromatic number
• The packing chromatic number of hypercubes
• A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices
• Facial packing vertex-coloring of subdivided plane graphs
• On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs
• A survey on packing colorings
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• Packing chromatic number of windmill related graphs and chain silicate networks
• Packing chromatic number of certain fan and wheel related graphs
• On the Choice Number of Packings
• Packing chromatic number versus chromatic and clique number
• \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\)
• Partial packing coloring and quasi-packing coloring of the triangular grid
• Packing coloring of Sierpiński-type graphs
• A lower bound for the packing chromatic number of the Cartesian product of cycles
• On \(S\)-packing edge-colorings of cubic graphs
• A note on \(S\)-packing colorings of lattices
• Packing chromatic number of distance graphs
• On the packing chromatic number of square and hexagonal lattice
• Packing chromatic numbers of finite super subdivisions of graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• Independence number and packing coloring of generalized Mycielski graphs
• The packing chromatic number of the infinite square grid is 15
• A note on the packing chromatic number of lexicographic products
• On the packing chromatic number of Moore graphs
• On the packing chromatic number of subcubic outerplanar graphs
• Subdivision into \(i\)-packings and \(S\)-packing chromatic number of some lattices
• A note on packing chromatic number of the square lattice
• \((d, n)\)-packing colorings of infinite lattices
• On \(S\)-packing edge-colorings of graphs with small edge weight
• Facial packing edge-coloring of plane graphs
• On uniquely packable trees
• The packing coloring of distance graphs \(D(k,t)\)
• On packing colorings of distance graphs
• Packing chromatic number of base-3 Sierpiński graphs
• Polynomial instances of the packing coloring problem
• The packing chromatic number of the infinite square lattice is between 13 and 15
• Packing coloring of some undirected and oriented coronae graphs
• Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph
• Packing chromatic number under local changes in a graph
• Dichotomies properties on computational complexity of \(S\)-packing coloring problems
• \(S\)-packing colorings of cubic graphs
• The packing chromatic number of infinite product graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987667)