chromatic number;
set coloring;
set chromatic number;
neighbor;
distinguishing coloring;
D O I:
10.7151/dmgt.1679
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
We provide a tight bound on the set chromatic number of a graph in terms of its chromatic number. Namely, for all graphs G, we show that chi(s)(G) equal to or greater than inverted right perpendicularlog(2) chi(G)inverted left perpendicular + 1, where chi(s)(G) and chi(G) are the set chromatic number and the chromatic number of G, respectively. This answers in the affirmative a conjecture of Gera, Okamoto, Rasmussen and Zhang.