Midwest theory of computation symposium
S. L. Hakimi, Oded Kariv · ACM SIGACT News · 1984
Bounds are given on the number of colors required to color the edges of a graph (multigraph) such that each color appears at each vertex v at most m(v) times. The known results and proofs generalize in natural ways. Certain new edge-coloring problems, which have no counterparts when m(v) = 1 for all vεV, are studied.