%A LIU Zhuo-ya, XU Chang-qing
%T Adjacent vertex distinguishing edge coloring of planar graphs without intersecting triangles
%0 Journal Article
%D 2020
%J JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
%R 10.6040/j.issn.1671-9352.0.2019.610
%P 36-41
%V 55
%N 9
%U {http://lxbwk.njournal.sdu.edu.cn/CN/abstract/article_3330.shtml}
%8
%X A *k*-adjacent vertex distinguishing edge coloring of a graph *G *is a proper *k*-edge coloring of *G *such that for any two adjacent vertices *u *and *v*, the color set of edges incident with *u* is different from the color set of edges incident with *v*. The least *k* for a *k*-adjacent vertex distinguishing edge coloring of *G* is the adjacent vertex distinguishing chromatic number, denoted by *χ'*_{a}(G). By using the discharging method, we study the adjacent vertex distinguishing chromatic number of a planar graph without intersecting triangles, and get the conclusion: if *G* is a planar graph without intersecting triangles, then *χ'*_{a}(G)≤max{Δ(G)+2,10}.