Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
