On the packing chromatic number of some lattices

DOI10.1016/J.DAM.2009.06.001zbMATH Open1221.05137OpenAlexW2027444730MaRDI QIDQ987667FDOQ987667

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

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

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)

Cites Work

• Broadcast chromatic numbers of graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• Title not available (Why is that?)

Cited In (44)

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

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)