The Orthogonal Colouring Game - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2019

The Orthogonal Colouring Game

(1) , (2) , (3) , (2)
1
2
3

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.
Fichier principal
Vignette du fichier
Corrected_TCS_orthogonalGraphColoringGame.pdf (381.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02017462 , version 1 (13-02-2019)
hal-02017462 , version 2 (01-03-2019)
hal-02017462 , version 3 (04-03-2019)
hal-02017462 , version 4 (16-04-2019)

Identifiers

  • HAL Id : hal-02017462 , version 4

Cite

Stephan Dominique Andres, Melissa Huggan, Fionn Mc Inerney, Richard J Nowakowski. The Orthogonal Colouring Game. Theoretical Computer Science, 2019, 795, pp.312-325. ⟨hal-02017462v4⟩
263 View
337 Download

Share

Gmail Facebook Twitter LinkedIn More