image-Chromatic numbers and hereditary properties of graphs Original Research Article

Given non-negative integers r, s, and t, an image-coloring of a graph image is a mapping c from image to the color set image, image, such that image for every two adjacent vertices image, image for every two adjacent edges image, and image for all pairs of incident vertices and edges, respectively. The image-chromatic number image of G is defined to be the minimum k such that G admits an image-coloring. We characterize the properties image for image as well as for image and image using well-known hereditary properties. The main results for image are summarized in a diagram.