@article{Al-Ibrahim_Al-Ibrahim_Rafique_Al-Sumait_2016, title={Complementary Graph Coloring}, volume={23}, url={https://ijcjournal.org/index.php/InternationalJournalOfComputer/article/view/736}, abstractNote={<p class="Els-Abstract-text">The objective of the Graph Coloring problem is to color vertices of a graph in such a way that no two vertices that share an edge are assigned the same color. Aircraft Scheduling, Frequency Assignment, register allocation are all real life applications that can be solved using graph coloring. Graph Coloring is a well-known NP-complete problem to the academia in computer science and mathematics. In this paper we use the concept of complementary graphs to come up with a new heuristic for graph coloring. Our results are compared with an exact algorithm and other heuristic algorithms to evaluate our algorithm’s performance. </p>}, number={1}, journal={International Journal of Computer (IJC)}, author={Al-Ibrahim, Mohamed and Al-Ibrahim, Naser and Rafique, Yousef and Al-Sumait, Omar}, year={2016}, month={Nov.}, pages={42–52} }