Data supporting results concerning colourings for the edge dynamic graph colouring problem with and without future adjacency information

The graph colouring problem (GCP) is a well-studied combinatorial optimisation problem that is known to be NP-hard. Most algorithms for solving the GCP do not consider the possibility of a graph changing over time. In our research, we consider a dynamic version of the graph colouring problem in which the edge set is allowed to change. By considering a dynamic graph as a series of static graphs, our approach takes a feasible colouring for the static-representation of a dynamic graph at one time-step and modifies it in some way to be used as an initial, though not necessarily feasible, colouring for the static-representation of the dynamic graph in the following time-step. We consider two situations; firstly, where the changes occur at random, and secondly, where probabilistic information regarding future change is known.