The Coloring Of Pseudo-halin Graphs

The coloring problem is always important problem in graph theory.In the discrete mathematics and combinatorial analysis,the coloring problem has a wide range of applications.The problem are closely related to coloring theory in many different areas.For example,scheduling,time-table probem,the problem of storing,and so on,it is the case,the theoretical significanae and practical value of graph coloring theories aroused the worldwide interest.In this paper,we mainly study the strong edge coloring and incidence coloring of Pseudo-Halin graphs.The concrete and results are as follows.Firstly,we summarize the current research on coloring of general graph and related basic concepts.For example,edge coloring,strong edge coloring,vertex coloring, indicen- ce coloring and so on.Secondly,the article introduce the concept of strong edge coloring and incidence coloring.Finally,we depend on the structure of Pseudo-Halin, we re-adjust the colors of some edges with construction methods, we proved the strong edge chromatic number of of a class of pseudo-Halin graph that satisfied strong edge coloring conjecture.And studied the incidence coloring of Pseudo-Halin graphs.