科研之友
微信
新浪微博
Facebook
分享链接
摘要
An adjacent vertex-distinguishing edge coloring, or avd-coloring, of a graph G is a proper edge coloring of G such that no pair of adjacent vertices meets the same set of colors. Let and Delta(G) denote the maximum average degree and the maximum degree of a graph G, respectively. In this paper, we prove that every graph G with Delta(G)a parts per thousand yen5 and can be avd-colored with Delta(G)+1 colors. This completes a result of Wang and Wang (J. Comb. Optim. 19:471-485, 2010).
- 出版日期2013-7
