The coloring problem of graph is the classical field of graph theory which is widely used in the network structure and practical life. The coloring problem is becoming a hot topic in recent years. However, the total coloring, especially adjacent vertex-distinguishing total coloring is a difficult point of the coloring problem. For a necklace, the adjacent vertex-distinguishing total coloring, the adjacent vertex-distinguishing vertex edge total coloring, and the incidence adjacent vertex-distinguishing total coloring are discussed when h≥3 (h is able to determine the number of vertices of necklace, h means that the necklace has 2h+2 vertices in the N_h). Through setting up a corresponding relation between the set of vertices and edges and the set of color, the corresponding chromatic numbers of the adjacent vertex-distinguishing total coloring, the adjacent vertex-distinguishing vertex edge total coloring, and the incidence adjacent vertex-distinguishing total coloring are obtained, the chromatic numbers for a necklace are five, three, and four, respectively. At the same time, the corresponding coloring schemes are given.