Addressing scheduling problems with the best graph coloring algorithm has always been very challenging. However, university timetable problem can be formulated as a where courses are represented vertices and presence of common students or teachers corresponding edges. After that, stands to color lowest possible colors. In order accomplish this task, paper presents comparative study use in sched...