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 co...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 was proved, and the incidence chromatic number of complete k partite graphs was calculated.展开更多
文摘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 was proved, and the incidence chromatic number of complete k partite graphs was calculated.
