The New Coloring Problems Of Some Graphs

Graph coloring is one of the main contents of graph theory.In recent years,more and more people start to study graph coloring, some important results are obtained and many new coloring concepts are brought up. In this paper,coloring problems of some graphs are studied. The paper has five parts:In the first part,some related concepts,frequent terminologies and notations are introduced. In the second part,the general vertex distinguishing total coloring of graphs are discussed. In the third part,some reducible coloring problems of some graphs are discussed. In the fourth part,the Samrandachely adjacent edge coloring problems of some graphs are discussed. In the fifth part,the probability estimates of Smarandachely adjacent vertex edge chromatic number of graphs are discussed.