This study examines the runtime complexity of various graph generation methods combined with four different coloring algorithms.

Graph generation will be examined first, and then smallest last vertex ordering, coloring algorithm,
and finally the ordering capabilities will be examined. Graph generation types used: Cycle Complete Random uniform Random skewed low Random skewed high

Coloring algorithm used is a modified greedy algorithm.