|
Organizers |
On Some Coloring Concepts in Graphs: A Brief Survey
by
Renu Laskar
Clemson University
Coauthors: G. Domke, O. Favaron, J. Hattingh, S.M. Hedetniemi, S.T. Hedetniemi, D. Rautenbach
A k-coloring of a graph G=(V, E) is a partition of V(G) into k subsets called color classes. A proper k-coloring is a k-coloring where the induced subgraph of each class is independent. We investigate different varieties of colorings including complete, best, Grundy, partial Grundy, harmoneous, line-distinguishing, 1-complete, pseudo-complete, pseudo-harmonious colorings and rankings of graphs.
Date received: April 16, 2001
Copyright © 2001 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Mathematical Conference Abstracts. Document # cags-22.