The incidence chromatic number of some graph (Q2570955)

Summary: The concept of the incidence chromatic number of a graph was introduced by \textit{R. A. Brualdi} and \textit{J. J. Q. Massey} [Discrete Math. 122, 51--58 (1993; Zbl 0790.05026)]. They conjectured that every graph \(G\) can be incidence colored with \(\Delta(G)+2\) colors. In this paper, we calculate the incidence chromatic numbers of the complete \(k\)-partite graphs and give the incidence chromatic number of three infinite families of graphs.