\((d, n)\)-packing colorings of infinite lattices

DOI10.1016/j.dam.2017.11.036zbMath1380.05071OpenAlexW2775190785MaRDI QIDQ1701099

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

zbMATH Keywords

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

Packing chromatic numbers of finite super subdivisions of graphs ⋮ On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs ⋮ A survey on packing colorings ⋮ On the packing chromatic number of subcubic outerplanar graphs ⋮ A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices ⋮ Graphs that are critical for the packing chromatic number

Cites Work

• Unnamed Item
• Unnamed Item
• The packing chromatic number of the infinite square lattice is between 13 and 15
• On the packing chromatic number of some lattices
• The packing chromatic number of infinite product graphs
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
• Modeling the packing coloring problem of 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
• On the packing chromatic number of square and hexagonal lattice
• Subdivision into i-packings and S-packing chromatic number of some lattices

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