Adjacent Vertex Reducible Edge-Total Coloring of Graphs
Jingwen Li, Zhang Zhong-fu, Enqiang Zhu, Wenhui Xu, Fei Wen, Lin Li, Ji Zhang · 2009
Let G(V, E) be a simple graph,k (1 les k les Delta + 1) is a positive integer, f is a mapping from V(G) upsi E(G) to {1, 2,..., k} such that foralluu, uw isin E(G), v ne w, f(uv) ne f(uw); foralluv isin E(G), if d(u) = d(v)then C(u) = C(v); we say that f is the adjacent vertex reducible edge-total coloring of G. The maximum number of k is called the adjacent vertex reducible edge-total chromatic number of G, simply denoted by chiavret(G). Where C(u) = {f(u)\u isin V(G)} cup {f(uv)|uv isin E(G)}. In this paper the adjacent vertex reducible edge-total chromatic number of some special graphs.