|
MASCOTTE no longer exists => visit the new project-team
Internship MASCOTTEGreedy edge-colouring
by Ana Karolina MAIA DE OLIVEIRA
| | | | Advisor | F. Havet | | School | Universidade Federal do Ceara | | Degree | Master | | Period | 30/03/10-30/06/10 |
<br />A greedy edge-colouring of a graph G is an edge colouring that can be obtained by applying the greedy algorithm according to some ordering of the edges of G.<br />The edge-Grundy number of a graph is maximum number of colours<br />of a greedy colouring of G.<br />The proposed work is to obtain lower and upper bounds of the edge-Grundy number and some complexity results.<br />
List of interships |
