Durgun D.D.Ozen Dortok H.B.2024-07-222024-07-22201903549836http://akademikarsiv.cbu.edu.tr:4000/handle/123456789/14646Graph 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.EnglishAll Open Access; Gold Open AccessGraph theoryColoring of graphGeneral graphGraph coloringsNP CompletePacking chromatic numbersPacking coloringsPath and cycleTransformation graphsGraphic methodsArticle10.2298/TSCI190720363D