抄録
The edge-coloring problem is one of the fundamental problems on graphs, which often appears in various scheduling problems like the file transfer problem on computer networks. In this paper, we survey old and new results on the classical edge-coloring problem as well as the generalized edge-coloring problems, called the f -coloring and f g -coloring problems. In particular we especially review various upper bounds on the minimum number of colors required to edge-color graphs, and present efficient algorithms to edge-color graphs with a number of colors not exceeding the upper bounds.
