Skip to Main content Skip to Navigation

The Orthogonal Colouring Game

Stephan Dominique Andres 1 Melissa Huggan 2 Fionn Mc Inerney 3 Richard Nowakowski 2
3 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : We introduce the Orthogonal Colouring Game, in which two players alternately colour vertices (from a choice of m ∈ N colours) of a pair of isomorphic graphs while respecting the properness and the orthogonality of the colouring. Each player aims to maximise her score, which is the number of coloured vertices in the copy of the graph she owns. The main result of this paper is that the second player has a strategy to force a draw in this game for any m ∈ N for graphs that admit a strictly matched involution. An involution σ of a graph G is strictly matched if its fixed point set induces a clique and any non-fixed point v ∈ V (G) is connected with its image σ(v) by an edge. We give a structural characterisation of graphs admitting a strictly matched involution and bounds for the number of such graphs. Examples of such graphs are the graphs associated with Latin squares and sudoku squares.
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download
Contributor : Fionn Mc Inerney <>
Submitted on : Wednesday, February 13, 2019 - 11:00:36 AM
Last modification on : Friday, June 5, 2020 - 9:26:02 PM
Document(s) archivé(s) le : Tuesday, May 14, 2019 - 2:49:10 PM


Files produced by the author(s)


  • HAL Id : hal-02017462, version 1


Stephan Dominique Andres, Melissa Huggan, Fionn Mc Inerney, Richard Nowakowski. The Orthogonal Colouring Game. [Research Report] Inria - Sophia Antipolis. 2019. ⟨hal-02017462v1⟩



Record views


Files downloads