Salama, F. (2019). New algorithm for calculating chromatic index of graphs and its applications. test, 27(1), 1-8. doi: 10.1186/s42787-019-0018-9
F. Salama. "New algorithm for calculating chromatic index of graphs and its applications". test, 27, 1, 2019, 1-8. doi: 10.1186/s42787-019-0018-9
Salama, F. (2019). 'New algorithm for calculating chromatic index of graphs and its applications', test, 27(1), pp. 1-8. doi: 10.1186/s42787-019-0018-9
Salama, F. New algorithm for calculating chromatic index of graphs and its applications. test, 2019; 27(1): 1-8. doi: 10.1186/s42787-019-0018-9

New algorithm for calculating chromatic index of graphs and its applications

Journal of the Egyptian Mathematical Society
Article 18, Volume 27, Issue 1, 2019, Pages 1-8    PDF (840 K)
DOI: 10.1186/s42787-019-0018-9
Author
F. Salama1, 2
1Department of Mathematics, Faculty of Science, Tanta University, Tanta, Egypt
2Department of Mathematics, Faculty of Science, Taibah University, Madinah, Kingdom of Saudi Arabia
Abstract
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.

Keywords
Graph; Edge coloring; Chromatic index; Incidence matrix
Statistics
Article View: 16
PDF Download: 16