Hits :

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

Date of Publication : 2017-01-01

Document Type : 期刊

Journal : Journal of Combinatorial Optimization

Volume: Vol.34

Issue : No.3

Page Number : 742-759

ISSN : 1382-6905;1573-2886

Translation or Not : no

Key Words : Subcubic;graph;List;neighbor-sum-distinguishing;edge;coloring;Maximum;average;degree;Combinatorial;Nullstellensatz

Abstract : A graph G is said to be neighbor-sum-distinguishing edge k-choose if, for every list L of colors such that L(e) is a set of k positive real numbers for every edge e, there exists a proper edge coloring which assigns to each edge a color from its list so t