Coloring Of Some Classes Of Expansion Graphs

Graph coloring theory is playing a very important role in graph theory, and total coloring is a popular topic for researchers. This paper studies chromatic number problem of the maximum expansion graph.First,it proves that the maximum expansion graph is to meet the total coloring conjecture demand.Second, it shows the maximum expansion graph is a necessary condition for the first class diagram. On the basis of this condition, there is a total coloring method for the maximum expansion graph.Last,it proves that the maximum expansion of regular graphs is to satisfy the equitable total-coloring conjecture.