Packing chromatic number of transformation graphs
Keyword(s):
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.
Keyword(s):
2014 ◽
Vol 4
(1)
◽
pp. 27
2021 ◽
Vol 33
(5)
◽
pp. 66-73
Keyword(s):
2018 ◽
Vol 341
(2)
◽
pp. 474-483
◽
2013 ◽
Vol 05
(04)
◽
pp. 1350024
◽
Keyword(s):