A heuristic approach for searching \((d, n)\)-packing colorings of infinite lattices

DOI10.1016/j.dam.2018.09.018zbMath1406.05105OpenAlexW2898242909MaRDI QIDQ1730261

Aleksander Vesel, Žiga Markuš, Danilo Korže

Publication date: 11 March 2019

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

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

zbMATH Keywords

graph algorithmheuristic algorithmpacking coloringinfinite lattice

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A survey on packing colorings

Cites Work

• Unnamed Item
• Unnamed Item
• The packing chromatic number of the infinite square lattice is between 13 and 15
• The packing chromatic number of infinite product graphs
• \((d, n)\)-packing colorings of infinite lattices
• 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
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

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