On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

DOI10.1016/j.endm.2007.07.040zbMath1341.05064OpenAlexW2180557372MaRDI QIDQ5900073

Douglas F. Rall, Sandi Klavžar, Boštjan Brešar

Publication date: 5 June 2008

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2007.07.040

zbMATH Keywords

subdivision graphCartesian product of graphspacking chromatic numberhexagonal lattice

Mathematics Subject Classification ID

Trees (05C05) 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)

Packing chromatic number of subdivisions of cubic graphs

Cites Work

• On the independence graph of a graph
• Distributive online channel assignment for hexagonal cellular networks with constraints
• 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs
• A technique for multicoloring triangle-free hexagonal graphs
• Perfect r-domination in the Kronecker product of three cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the packing chromatic number of Cartesian products, hexagonal lattice, and trees