The Complexity of Two Colouring Games.

We consider two variants of on graphs. In these games, two players alternate colouring uncoloured vertices (from a choice of colours) of a pair of isomorphic graphs while respecting the properness and the orthogonality of the partial colourings. In the , the first player unable to move loses.