Graph reconfiguration and colouring problems investigate the transition between feasible solutions of a graph colouring instance. The central challenge is to determine a series of elementary vertex ...

This is a preview. Log in through your library . Abstract This paper describes the application of a vertex coloring procedure to a real life examination scheduling problem. The accessories used in ...

Consider an urn model where at each step one of q colors is sampled according to some probability distribution and a ball of that color is placed in an urn. The distribution of assigning balls to urns ...