Modeling the packing coloring problem of graphs
type: Item
instance of: scholarly article
title: Modeling the packing coloring problem of graphs
zbMATH Open document ID: 1443.05077
author: Zehui Shao
author: Aleksander Vesel
published in: Applied Mathematical Modelling
publication date: 2019-12-03T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 7139244
zbMATH Keywords: frequency assignment
zbMATH Keywords: packing chromatic number
zbMATH Keywords: integer linear programming
zbMATH Keywords: Cartesian product
describes a project that uses: CALMA
MaRDI profile type: Publication
full work available at URL: j.apm.2014.11.060
OpenAlex ID: W1967139416
cites work: Models and solution techniques for frequency assignment problems
cites work: Exact Algorithms for L(2,1)-Labeling of Graphs
cites work: On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
cites work: Q3070232
cites work: Complexity of the packing coloring problem for trees
cites work: Q3005852
cites work: A note on packing chromatic number of the square lattice
cites work: The packing chromatic number of infinite product graphs
cites work: A lower bound for the packing chromatic number of the Cartesian product of cycles
cites work: On the packing chromatic number of square and hexagonal lattice
cites work: On packing colorings of distance graphs
cites work: Packing chromatic number of distance graphs
cites work: The packing coloring of distance graphs \(D(k,t)\)
DOI: 10.1016/J.APM.2014.11.060
description: scientific article; zbMATH DE number 7139244