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.
Salama, F. (2019). New algorithm for calculating chromatic index of graphs and its applications. Journal of the Egyptian Mathematical Society, 27(1), 1-8. doi: 10.1186/s42787-019-0018-9
MLA
F. Salama. "New algorithm for calculating chromatic index of graphs and its applications", Journal of the Egyptian Mathematical Society, 27, 1, 2019, 1-8. doi: 10.1186/s42787-019-0018-9
HARVARD
Salama, F. (2019). 'New algorithm for calculating chromatic index of graphs and its applications', Journal of the Egyptian Mathematical Society, 27(1), pp. 1-8. doi: 10.1186/s42787-019-0018-9
VANCOUVER
Salama, F. New algorithm for calculating chromatic index of graphs and its applications. Journal of the Egyptian Mathematical Society, 2019; 27(1): 1-8. doi: 10.1186/s42787-019-0018-9
)
