PACKING CHROMATIC NUMBER OF TRANSFORMATION GRAPHS

No Thumbnail Available

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

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.

Description

Keywords

Citation

URI

http://hdl.handle.net/20.500.14701/34285

Collections

Web of Science Koleksiyonu