Liu, Xikui; Li, Yan The incidence chromatic number of some graph. (English) Zbl 1073.05029 Int. J. Math. Math. Sci. 2005, No. 5, 803-813 (2005). Summary: The concept of the incidence chromatic number of a graph was introduced by R. A. Brualdi and 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. Cited in 4 Documents MSC: 05C15 Coloring of graphs and hypergraphs Citations:Zbl 0790.05026 PDFBibTeX XMLCite \textit{X. Liu} and \textit{Y. Li}, Int. J. Math. Math. Sci. 2005, No. 5, 803--813 (2005; Zbl 1073.05029) Full Text: DOI EuDML