A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
New algorithm for calculating chromatic index of graphs and its applications
2019
Journal of the Egyptian Mathematical Society
Preserved Fulltext
The problem of edge coloring is one of the fundamental problems in the graph theory. Graph coloring problem arises in several ways like to allocate scheduling and assignments. To follow this line of investigation, we design a new algorithm called "RF algorithm" to color the edges of a graph. In addition, we reinstate some classical results by applying the RF algorithm.
doi:10.1186/s42787-019-0018-9
fatcat:qzvshxs62rcydasudggx5mouia