Packing chromatic number of transformation graphs
No Thumbnail Available
Date
2019
Authors
Journal Title
Journal ISSN
Volume Title
Abstract
Graph coloring is an assignment of labels called colors to elements of a graph. The packing coloring was introduced by Goddard et al. [1] in 2008 which is a kind of coloring of a graph. This problem is NP-complete for general graphs. In this paper, we consider some transformation graphs and generalized their packing chromatic numbers. © 2019 Society of Thermal Engineers of Serbia.