On the adjacent vertex-distinguishing acyclic edge coloring of some graphs
WC Shiu, WH Chan, Z Zhang, L Bian - Applied Mathematics-A Journal of …, 2011 - Springer
A proper edge coloring of a 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 with u is not …
coloring if there is no 2-colored cycle in G and the coloring set of edges incident with u is not …
[引用][C] On the Adjacent Vertex-distinguishing Acyclic Edge Coloring of Graphs
WC Shiu1a, WH Chan1b, Z Zhang, L Bian