The game Grundy number of graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2011

The game Grundy number of graphs

Abstract

Given a graph G = (V;E), two players, Alice and Bob, alternate their turns in choosing uncoloured vertices to be coloured. Whenever an uncoloured vertex is chosen, it is coloured by the least positive integer not used by any of its coloured neighbours. Alice's goal is to minimize the total number of colours used in the game, and Bob's goal is to maximize it. The game Grundy number of G is the number of colours used in the game when both players use optimal strategies. It is proved in this paper that the maximum game Grundy number of forests is 3, and the game Grundy number of any partial 2-tree is at most 7.
Fichier principal
Vignette du fichier
RR-7646.pdf (228.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00600738 , version 1 (15-06-2011)

Identifiers

  • HAL Id : inria-00600738 , version 1

Cite

Frédéric Havet, Xuding Zhu. The game Grundy number of graphs. [Research Report] RR-7646, INRIA. 2011. ⟨inria-00600738⟩
209 View
695 Download

Share

Gmail Facebook X LinkedIn More