A Bound of Adjacent Vertex-Distinguishing Acyclic Edge Coloring of Graphs
Qiang Hui-ying, Muchun Li, Zhang Zhong-fu · Xitong kexue yu shuxue · 2008
A proper edge coloring of the graph G is called adjacent vertex distinguishing acyclic edge coloring,if there is no 2-colored cycle in G,and the coloring set of edges incident to u is not equal to the coloring set of edges incident to v,where uv∈E(G).In this paper,a new upper bound of adjacent vertex distinguishing acyclic edge coloring of the graph G with no isolated edges is obtained by the way of probability.