Implementation of a parallel method for the graph coloring problem using MPI and verification of the number of processors on it

In this paper, a parallel version based on a pipeline of innovative methods for graph coloring in a sequential mode is presented. The results of the execution time for parallel implementation in the C++ language using the Message Passing Interface (MPI) on a multi-processor machine is presented and discussed. This problem also has been implemented in a fully sequential and recursive mode, in the same environment, and the results of comparing them to parallel implementation have been reported.