On the adjacent strong edge coloring of P_m×P_n and P_m×C_n
Chen Xiang-en · Gansu Nongye Daxue xuebao · 2005
Let G be a simple connected graph with order not less than 3, k-proper edge coloring of G is called adjacent strong,if for arbitrary two adjacent vertices which are incident to different sets of colored edges. The minimum number required for an adjacent-strong edge coloring of G is called the adjacent strong edge chromatic number. The adjacent strong edge chromatic number of Pm×Pn and Pm×Cn, are ob tained in this paper.