THE 2-STRONG EDGE-COLORING of SOME GENERAL CROWN GRAPHS of CIRCLE
Tian Jing-jing · Journal of Mathematics · 2011
In this paper,the 2-strong edge coloring (D(2)-vertex-distinguishing edge coloring) of C m F n,C m W n,C m C n are studied.By using color one by one and recursion,2-strong edge chromatic number (D(2) vertex-distinguishing edge chromatic number) of them are obtained,the coloring method of the general crown graph of circle is given,which extends some corresponding results in [6,7].