LIU Xin-sheng, LU Wei-hua. An upper bound for the vertex-distinguishing star edge chromatic number of graphs[J]. Journal of East China Normal University(Natural Sc, 2012, 2012(5): 120-126.
{1} GUILLAUME F, BRUCE R. Star coloring of graphs[J].Journal of Graph Theory, 2004, {47(3)}: 163-182.{2} LIU X S, DENG K. An upper bound on the star edge chromatic index of graphs with $\Delta\geqslant 7$[J]. Journal of Lanzhou University,2008, {44(2)}: 98-100.{3} CRISSTINA B, AMEL H B, Li H. On the vertex-distinguishing proper edge-colorings[J]. Journal of Combinatorial Theory Series B, 1999, {75(2)}: 288-301.{4} BURIS A C, SCHELP R H. Vertex-distinguishing proper edge colorings[J]. Journal of Graph Theory, 1997, {26(2)}: 74-82.{5} ALON, SADAKOV B, ZAKS A. Acyclic edge coloringa of graphs[J]. Journal of Graph Theory, 2001, 37: 157-167.{6} RAHUL M, NARAYANAN N, SUBRAMANIAN C R.Improved bounds on acyclic edge clouring[J]. Discrete Mathematics,{2007, 307: 3063-3069}.{7} MICHAEL M, BRUCE R. Graph Coloring and the Probabilistic Method[M]. New York: Springer-Verlag, 2002. {8} BONDY J A, MURTY U S R. Graph Theory with Applications[M]. New York: Macmillan Press Ltd, 1976. {9} ALON N, SPENCER J. The Probabilistic Method[M]. New York: John Wiley and Sons, 1992. {10} LIU X S, ZHU Z Q. An Upper Bound on the Vertex-Distinguishing IE-TotalChromatic Number of Graphs[J]. Journal of Shandong University,2009, {44(10)}: 14-16. {11}LIU X S, AN M Q, GAO Y.An upper bound for the adjacent vertex-distinguishing totalchromatic number of a graph[J]. Journal of Mathematical Research \&Exposition, 2009, {29(2)}: 343-348. {12} LIU X S, WEI Z Y. An upper bound for the vertex-distinguishing acyclic edgechromatic number of graphs[J]. Journal of Lanzhou University, 2010,{46(5)}: 75-78.