Adjacent Vertex Distinguishing Total Coloring of a Class of Outerplane Graphs

Jianwei Du · Journal of North University of China · 2009

Based on the study of the structure of outerplane graphs,this paper mainly discusses the adjacent vertex distinguishing total coloring of the outerplane graph to resolve the algorithm of the chromatic number of a graph.It′s proved by using analysis method and mathematical induction,the adjacent vertex distinguishing total chromatic number of a class of outerplane graphs is obtained.

Read the paper · More papers on PaperTik