On Incidence Coloring for Some Graphs of Maximum Degree \(4\)

Hamed Fahimi1, Behnaz Omoomi1
1Depariment of Mathematical Sciences Isfahan University of Technology 84156-83111, Isfahan, Iran

Abstract

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\).