On incidence coloring for some cubic graphs

In 1993, Brualdi and Massey conjectured that every graph can be incidence colored with + 2 colors, where is the maximum degree of a graph. Although this conjecture was solved in the negative by an example in [1], it might hold for some special classes of graphs. In this paper, we consider graphs with maximum degree = 3 and show that the conjecture holds for cubic Hamiltonian graphs and some other cubic graphs. Key words and phrases : Cubic graph, incidence coloring, restrained decomposition 2000 MSC : 05C15, 05C45

• Type: Journal
• Year: 2002
• Where: DM
• Authors: Wai Chee Shiu, Peter Che Bor Lam, Dong-Ling Chen
• Keywords: Cubic Graph, Cubic Hamiltonian Graphs, DM 2002, Maximum Degree