Hits :

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

Date of Publication : 2014-01-01

Document Type : 期刊

Journal : Journal of Graph Theory

Issue : No.3-4

Page Number : 262-278

Translation or Not : no

Key Words : color;set;neighbor-distinguishing;edge;coloring;neighbor-distinguishing;index;planar;graph

Abstract : A proper edge coloring of a graph G without isolated edges is neighbor-distinguishing if any two adjacent vertices have distinct sets consisting of colors of their incident edges. The neighbor-distinguishing index of G is the minimum number ndi(G) of colo