Brualdi and Massey in \(1993\) posed two conjectures regarding the upper bound for incidence coloring number of graphs in terms of maximum degree. In this paper among some results, we prove these conjectures for some classes of graphs with maximum degree \(4\).