Adjacent strong edge coloring of P_m∨F_n
MA Shao-xian · Journal of Lanzhou University · 2008
A proper edge coloring is called adjacent strong edge coloring if colored sets from every two adjacent vertices' incident edge are different.The minimum number of colors required for an adjacent strong edge coloring,a simple graph G is denoted byχ′_(as)(G).In this paper,we have given the adjacent strong edge chromatic number of P_m∨F_n.