activity
20122022
most citedMinimal sufficient sets of colors and minimum number of colors

3 citations · 3 across the 5 of their papers we have counts for

collaborators
Showing 2012Show all

1 paper · 1 filter

math.CO2012

An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph

Lianzhu Zhang, Weifan Wang, Ko-Wei Lih

An adjacent vertex distinguishing coloring of a graph G is a proper edge coloring of G such that any pair of adjacent vertices are incident with distinct sets of colors. The minimu…