New algorithm for calculating chromatic index of graphs and its applications
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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2019-07-01
|
| Series: | Journal of the Egyptian Mathematical Society |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s42787-019-0018-9 |