Packing chromatic number of transformation graphs

Simple item page
dc.contributor.authorDurgun D.D.
dc.contributor.authorOzen Dortok H.B.
dc.date.accessioned2024-07-22T08:09:03Z
dc.date.available2024-07-22T08:09:03Z
dc.date.issued2019
dc.description.abstractGraph 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.
dc.identifier.DOI-ID10.2298/TSCI190720363D
dc.identifier.issn03549836
dc.identifier.urihttp://akademikarsiv.cbu.edu.tr:4000/handle/123456789/14646
dc.language.isoEnglish
dc.publisherSerbian Society of Heat Transfer Engineers
dc.rightsAll Open Access; Gold Open Access
dc.subjectGraph theory
dc.subjectColoring of graph
dc.subjectGeneral graph
dc.subjectGraph colorings
dc.subjectNP Complete
dc.subjectPacking chromatic numbers
dc.subjectPacking colorings
dc.subjectPath and cycle
dc.subjectTransformation graphs
dc.subjectGraphic methods
dc.titlePacking chromatic number of transformation graphs
dc.typeArticle

Files

Collections

Scopus Koleksiyonu