On the Adjacent-vertex Distinguishing Edge Coloring of C_(2m)×C_n
Rui Zhang · Journal of Gansu Sciences · 2007
Let G be a simple connected graph with order not less than 3.k-proper edge coloring of G is called adjacent-vertex distinguishing.If two arbitrarily adjacent vertics are incident to different sets of colored edges,the minimal number required for an adjacent-vertex distinguishing edge coloring(AVDEC) of G is called the adjacent strong edge chromatic number.The adjacent strong edge chromatic number of C2m×Cn is proved to be 5.