Department of Mathematics
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 I. Algor and N. Alon (Discrete Math. 75 (1989) 11) 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.
Cubic graph, Incidence coloring, Restrained decomposition
Source Publication Title
Link to Publisher's Edition
Shiu, W., Lam, P., & Chen, D. (2002). On incidence coloring for some cubic graphs. Discrete Mathematics, 252 (1-3). https://doi.org/10.1016/S0012-365X(01)00457-5