科研之友
微信
新浪微博
Facebook
分享链接
摘要
The general neighbor-distinguishing total chromatic number chi ''(gnd) (G) of a graph G is the smallest integer k such that the vertices and edges of G can be colored by k colors so that no adjacent vertices have the same set of colors. It is proved in this note that chi"(gnd)(G) = inverted right perpendicularlog(2) chi(G)inverted left perpendicular + 1, where chi(G) is the vertex chromatic number of G.
