A note on the packing chromatic number of lexicographic products

DOI10.1016/j.dam.2021.01.010zbMath1460.05058arXiv1909.11325OpenAlexW3123120864MaRDI QIDQ2659160

Dragana Božović, Iztok Peterin

Publication date: 25 March 2021

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

Full work available at URL: https://arxiv.org/abs/1909.11325

zbMATH Keywords

packing chromatic numberlexicographic product of graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

A characterization of 4-\(\chi_S\)-vertex-critical graphs for packing sequences with \(s_1 = 1\) and \(s_2 \geq 3\)

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity of the packing coloring problem for trees
• On the packing chromatic number of some lattices
• The packing chromatic number of infinite product graphs
• The chromatic number and other functions of the lexicographic product
• A lower bound for the packing chromatic number of the Cartesian product of cycles
• 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 note on the packing chromatic number of lexicographic products