Abstrak
NISCAYAH KIRING. implementation of the Sequential Coloring Algorithm and Welch Powell's Algorithm in graph coloring (mentor by Ratna Dwi Cristyanti). This study discusses the implementation of the Sequential Coloring Algorithm and Welch Powell's Algorithm in graph coloring. Graph coloring to solve course scheduling problems. Graph coloring is one of the applications in Graph theory, which is to give a color to a vertex, both minimum and maximum colors. The coloring process is carried out by avoiding the same color at the neighboring ends, so that a minimum color is obtained. Thus the user can more easily make a schedule. Based on the results of the study, it was shown that coloring graphs using both algorithms obtained color comparisons for each subject, where the coloring of scheduling nodes using Welch Powell's algorithm produced a chromatic number X(G) = 10 and the Sequential Coloring algorithm produced a chromatic number X(G) = 8 .