Durgun D.D.Ozen Dortok H.B.2025-04-102025-04-102019http://hdl.handle.net/20.500.14701/47475Graph 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.Packing chromatic number of transformation graphsArticle10.2298/TSCI190720363D