The adjacent vertex-distinguishing total coloring of some classes of funny graphs
Lei Sun · Shandong kexue · 2006
Under the definition of proper total coloring of a graph,an adjacent vertex-distinguishing total coloring means that none of the two adjacent vertices is incident with the same set of colores.The coloring set of vertex v is the colors(assigned) to v and the edges incident to v.The adjacent vertex-distinguishing total chromatic number about some classes of funny graphs are provided.