A generalization of edge‐coloring in graphs
S. L. Hakimi, Oded Kariv · Journal of Graph Theory · 1986
Abstract 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(ν) times. The known results and proofs generalize in natural ways. Certain new edge‐coloring problems, which have no counterparts when m(ν) = 1 for all ν ϵ V, are studied.