Hits :

First Author : Weifan Wang

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2015-01-01

Document Type : 期刊

Journal : SIAM Journal on Discrete Mathematics

Volume: Vol.29

Issue : No.4

Page Number : 2412–2431

ISSN : 0895-4801;1095-7146

Translation or Not : no

Key Words : adjacent vertex distinguishing coloring;planar graph;maximum degree

Abstract : An adjacent vertex distinguishing coloring of a graph $G$ is a proper edge coloring of $G$ such that any pair of adjacent vertices admits different sets of colors. The minimum number of colors needed for such a coloring of $G$ is denoted by $\chi\'_a(G)$.