\((d, n)\)-packing colorings of infinite lattices
type: Item
instance of: scholarly article
title: \((d, n)\)-packing colorings of infinite lattices
zbMATH Open document ID: 1380.05071
author: Danilo Korže
author: Aleksander Vesel
published in: Discrete Applied Mathematics
publication date: 2018-02-22T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6842196
zbMATH Keywords: coloring
zbMATH Keywords: \(S\)-packing
zbMATH Keywords: infinite lattice
MaRDI profile type: Publication
full work available at URL: j.dam.2017.11.036
OpenAlex ID: W2775190785
cites work: The packing chromatic number of infinite product graphs
cites work: On the packing chromatic number of some lattices
cites work: Subdivision into i-packings and S-packing chromatic number of some lattices
cites work: Q3070232
cites work: The \(S\)-packing chromatic number of a graph
cites work: A note on \(S\)-packing colorings of lattices
cites work: Q3005852
cites work: Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
cites work: On the packing chromatic number of square and hexagonal lattice
cites work: The packing chromatic number of the infinite square lattice is between 13 and 15
cites work: Modeling the packing coloring problem of graphs
cites work: A note on packing chromatic number of the square lattice
DOI: 10.1016/J.DAM.2017.11.036
description: scientific article; zbMATH DE number 6842196