On the f-coloring of multigraphs
Shin-ichi Nakano, Takao Nishizeki, 斎藤 順雄 · IEEE Transactions on Circuits and Systems · 1988
An f-coloring of a multigraph is a coloring of edges E such that each color appears at each vertex at most f times. The minimum number of colors needed to f-color G is called the f-chromatic index of G. Various scheduling problems on networks are reduced to finding an f-coloring of a multigraph. An upper bound on the f-chromatic index is given.>