MASCOTTE no longer exists => visit the new project-team
Seminaire MASCOTTEOn the (k-improper) Grundy number of a graph.
par Leonardo Sampaio
| Date : | 11/05/10 | | Time : | 10:30 | | Location : | Lagrange Gris |
A k-improper colouring of a graph is a function of its vertex set into a set of colours such that each vertex is adjacent to at most k vertices of the same colour.<br />Such a colouring is said to be greedy if it is produced by the greedy algorithm. The k-improper Grundy number of a graph G is the maximum number of colours of a greedy k-improper colouring G.<br /><br />In this talk, we will examine some complexity issues of the k-improper Grundy number.<br /><br />
Page des séminaires
| 
