4 citations · 4 across the 2 of their papers we have counts for
2 papers
math.CO2012★ 4 cited
Every 4-regular graph is acyclically edge-6-colorable
Wang Weifan, Shu Qiaojun, Wang Yiqiao
An acyclic edge coloring of a graph is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index of is the smallest integer $…
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…