On the Complexity of Orthogonal Colouring Games and the NP-Completeness of Recognising Graphs Admitting a Strictly Matched Involution - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2019

On the Complexity of Orthogonal Colouring Games and the NP-Completeness of Recognising Graphs Admitting a Strictly Matched Involution

Résumé

We consider two variants of orthogonal colouring games on graphs. In these games, two players alternate colouring vertices (from a choice of m ∈ N colours) of a pair of isomorphic graphs while respecting the properness and the orthogonality of the colouring. In the normal play variant, the player who is unable to move loses. In the scoring variant, each player aims to maximize her score which is the number of coloured vertices in the copy of the graph she owns. It is proven that, given an instance with a partial colouring, both the normal play and the scoring variant of the game are PSPACE-complete. An involution σ of a graph G is strictly matched if its fixed point set induces a clique and vσ(v) is an edge for any non-fixed point v ∈ V (G). Andres, Huggan, Mc Inerney, and Nowakowski (The orthogonal colouring game. Submitted) gave a solution of the normal play variant played on graphs that admit a strictly matched involution. We prove that recognising graphs that admit a strictly matched involution is NP-complete.
Fichier principal
Vignette du fichier
final06ComplexityPaperOrthogonalColouringGame.pdf (353.59 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02053265 , version 1 (01-03-2019)
hal-02053265 , version 2 (04-03-2019)
hal-02053265 , version 3 (02-12-2021)

Identifiants

  • HAL Id : hal-02053265 , version 2

Citer

Stephan Dominique Andres, François Dross, Melissa Huggan, Fionn Mc Inerney, Richard J Nowakowski. On the Complexity of Orthogonal Colouring Games and the NP-Completeness of Recognising Graphs Admitting a Strictly Matched Involution. [Research Report] Inria - Sophia Antipolis. 2019. ⟨hal-02053265v2⟩
452 Consultations
297 Téléchargements

Partager

Gmail Facebook X LinkedIn More