The set chromatic number of a graph

Gary Chartrand, et al. "The set chromatic number of a graph." Discussiones Mathematicae Graph Theory 29.3 (2009): 545-561. <http://eudml.org/doc/270852>.

@article{GaryChartrand2009,
abstract = {For a nontrivial connected graph G, let c: V(G)→ N be a vertex coloring of G where adjacent vertices may be colored the same. For a vertex v of G, the neighborhood color set NC(v) is the set of colors of the neighbors of v. The coloring c is called a set coloring if NC(u) ≠ NC(v) for every pair u,v of adjacent vertices of G. The minimum number of colors required of such a coloring is called the set chromatic number χₛ(G) of G. The set chromatic numbers of some well-known classes of graphs are determined and several bounds are established for the set chromatic number of a graph in terms of other graphical parameters.},
author = {Gary Chartrand, Futaba Okamoto, Craig W. Rasmussen, Ping Zhang},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {neighbor-distinguishing coloring; set coloring; neighborhood color set},
language = {eng},
number = {3},
pages = {545-561},
title = {The set chromatic number of a graph},
url = {http://eudml.org/doc/270852},
volume = {29},
year = {2009},
}

TY - JOUR
AU - Gary Chartrand
AU - Futaba Okamoto
AU - Craig W. Rasmussen
AU - Ping Zhang
TI - The set chromatic number of a graph
JO - Discussiones Mathematicae Graph Theory
PY - 2009
VL - 29
IS - 3
SP - 545
EP - 561
AB - For a nontrivial connected graph G, let c: V(G)→ N be a vertex coloring of G where adjacent vertices may be colored the same. For a vertex v of G, the neighborhood color set NC(v) is the set of colors of the neighbors of v. The coloring c is called a set coloring if NC(u) ≠ NC(v) for every pair u,v of adjacent vertices of G. The minimum number of colors required of such a coloring is called the set chromatic number χₛ(G) of G. The set chromatic numbers of some well-known classes of graphs are determined and several bounds are established for the set chromatic number of a graph in terms of other graphical parameters.
LA - eng
KW - neighbor-distinguishing coloring; set coloring; neighborhood color set
UR - http://eudml.org/doc/270852
ER -