Adjacent Vertex-Distinguishing Acyclic Edge Coloring of Graphs
Liang Bian · Journal of Qufu Normal University · 2008
In this paper,the concept of the adjacent vertex-distinguishing acyclic edge coloring and some conjectures about it are given.If G is a simple graph with no isolated edges and the adjacent vertex-distinguishing chromatic number of G is e,there exists r0,if g(G)≥rΔlogΔ,then G has(e+1) adjacent vertex-distinguishing acyclic edge coloring.