1 paper
Xiao-Chuan Liu, Boyan Xu, Xu Yang
Let k≥2 be an integer. A 1modk edge-coloring of a graph G is an edge-coloring in which every nonzero degree in each color class is congruent to 1 modulo k. Let $Ï'…