Hits :

First Author : Weifan Wang

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

Date of Publication : 2010-01-01

Document Type : 期刊

Journal : Journal of Combinatorial Optimization

Volume: Vol.19

Issue : No.4

Page Number : 471-485

Translation or Not : no

Key Words : Adjacent;vertex;distinguishing;edge-coloring;Graph;Maximum;average;degree;Maximum;degree

Abstract : An adjacent vertex distinguishing edge-coloring of a graph G is a proper edge coloring of G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing edge-c