(d, n)-packing colorings of infinite lattices

DOI10.1016/J.DAM.2017.11.036zbMATH Open1380.05071OpenAlexW2775190785MaRDI QIDQ1701099FDOQ1701099

Authors: Danilo Korže, Aleksander Vesel 

Publication date: 22 February 2018

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

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

Recommendations

• A note on \(S\)-packing colorings of lattices
• A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices
• Subdivision into \(i\)-packings and \(S\)-packing chromatic number of some lattices
• A survey on packing colorings
• On the packing chromatic number of some lattices

zbMATH Keywords

coloringinfinite lattice\(S\)-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

• Handbook of product graphs
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
• The packing chromatic number of infinite product graphs
• A note on packing chromatic number of the square lattice
• A note on \(S\)-packing colorings of lattices
• The \(S\)-packing chromatic number of a graph
• Broadcast chromatic numbers of graphs
• On the packing chromatic number of some lattices
• On the packing chromatic number of square and hexagonal lattice
• Modeling the packing coloring problem of graphs
• Subdivision into \(i\)-packings and \(S\)-packing chromatic number of some lattices
• The packing chromatic number of the infinite square lattice is between 13 and 15

Cited In (14)

• A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices
• Subdivision into \(i\)-packings and \(S\)-packing chromatic number of some lattices
• Mixing properties of colourings of the ℤ^d lattice
• Distance Coloring of the Hexagonal Lattice
• A survey on packing colorings
• On the packing chromatic number of some lattices
• Graphs that are critical for the packing chromatic number
• Coloring of the \(d^{\text{th}}\) power of the face-centered cubic grid
• On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs
• Partial packing coloring and quasi-packing coloring of the triangular grid
• On the packing chromatic number of subcubic outerplanar graphs
• A note on \(S\)-packing colorings of lattices
• The packing chromatic number of the infinite square grid is 15
• Packing chromatic numbers of finite super subdivisions of graphs

This page was built for publication: \((d, n)\)-packing colorings of infinite lattices

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