Adjacent Vertex Distinguishing Total Coloring of k_4-minor-free Graphs
Wan Hui-min · Journal of Wuyi University · 2012
A proper total coloring of graph G is called adjacent vertex distinguishing if the color sets of every two adjacent vertices are different.The paper determines the adjacent vertex distinguishing total chromatic numbers of k4-minor-free graphs.