Colored independence is a way in which we can understand scheduling/storage problems where events that cannot occur together are modeled by vertices connected by edges, and events that must occur together are modeled by vertices that have the same color. This research will be looking specifically at colored independence on cycles and grids. The number we strive to describe on said graphs is the independence partition number. The independence partition number can be defined as the minimum of the maximum independent set that exists on each partition of a graph G. This research will be able to contribute to the relatively small amount of research in this subject which will add to the amount of problems that can be modeled using this technique
Terhaar, Michael, "Colored Independence of Cycle Graphs and Finite Grids" (2014). Honors Theses. 54.