科研之友
微信
新浪微博
Facebook
分享链接
摘要
The adjacent vertex-distinguishing chromatic index chi(avd)'of a graph is the smallest integer for which admits a proper edge k-coloring such that no pair of adjacent vertices are incident with the same set of colors. In this paper, we prove that if G is a 2-degenerate graph without isolated edges, then chi(avd)' (G) <= mad{6, Delta(G) + 1}. Moreover, we also show that when Delta >= 6, chi(avd)' = Delta(G) + 1 if and only if G contains two adjacent vertices of maximum degree.
- 出版日期2016-2
- 单位安徽大学
