Evènement pour le groupe GT Graphes et Applications

Date 2014-11-07  14:00-15:00
TitreOn Colouring Games 
RésuméLet be given a graph G and a set C of r colours. Two players, Alice and Bob alternately colour a vertex of G in such a way that two adjacent vertices are not coloured with the same colour. Alice has the first move. If after |V(G)| moves the graph is properly coloured, then Alice wins, otherwise Bob wins. The above game is called the r-colouring game. The game chromatic number of G is the least number r for which Alice has a winning strategy for the colouring game with r colours on G. In this talk we will discuss some version of the colouring game and we will give winning strategies for Alice to play these games. We also will present upper bounds for the game chromatic numbers for some families of graphs.  
LieuSalle 178 
OrateurEl?bieta Sidorowicz 

Aucun document lié à cet événement.

Retour à l'index