Graph coloring is used in many real-timeapplications, and Graph coloring is an important concept in graph theory. Various areas of computer applications for research use graph coloring ideas. The main aim of this paper is to study on optimizing time because graph is coloring NP-hardproblem, so time-consuming process. In this paper, we study a parallel architecture for graph coloring algorithm. We implement in Open MP analyzing proposed parallel algorithm using Intel v-tune analyzer. After analyzing parallel graph coloring algorithm,we got 30% to 32% time optimization in 2core processor. This canbe used in many applications like air traffic control, GPS frequency reallocation, register allocation, timetable scheduling, and modeling sensor network. Various papers based on graph coloring have been studied related to parallel architecture, computer science application, and an overview has been presented here. © 2016, International Journal of Pharmacy and Technology. All rights reserved.