Some perfect coloring properties of graphs

https://doi.org/10.1016/0095-8956(79)90067-4Get rights and content
Under an Elsevier user license
open archive

Abstract

A Grundy n-coloring of a finite graph is a coloring of the points of the graph with the non-negative integers smaller than n such that each point is adjacent to some point of each smaller color but to none of the same color. The Grundy number of a graph is the maximum n for which it has a Grundy n-coloring. Characterizations are given of the families of finite graphs G such that for each induced subgraph H of G: (1) the Grundy number of H is equal to the chromatic number of H; (2) the Grundy number of H is equal to the maximum clique size of H; (3) the achromatic number of H is equal to the chromatic number of H; (4) the achromatic number of H is equal to the maximum clique size of H. The definitions are further extended to infinite graphs, and some of the above characterizations are shown to be true for denumerable graphs and locally finite graphs.

Cited by (0)

This work was supported by the National Research Council of Canada.