论文部分内容阅读
The concept of the incidence chromatic number of a graph was introduced by Brualdi and Massey. They conjectured that every graph G can be incidence colored with △(G)+ 2 colors. In this paper, the trueness of this conjecture for complete k-partite graph wa