Complexity of the packing coloring problem of trees

Abstract

We show that determining the packing chromatic number is an NP-hard problem for trees.

Keywords

• Computational complexity
• packing coloring
• tree