Evènement pour le groupe GT Graphes et Applications

Date 2014-03-14  14:00-15:00
TitreVariants of edge-colouring 
RésuméA strong edge-colouring of a graph is a partition of its edge-set into induced matchings. It is known that planar graphs can be strongly edge-coloured with 4Delta+4 colours, where Delta is the maximum degree of the graph. We improve this bound for several subfamilies of planar graphs and discuss some interesting links to a long standing conjecture of Vizing on proper edge-colouring of planar graphs. In the last part of the talk we will discuss a natural generalization of these two types of colourings where for two adjacent vertices the sets of colours incident to their edges have an intersection of bounded size. This last problem is related to some problems in combinatorial set theory. This is joint work with two groups of authors: J. Bensmail, A. Harutyunyan, H. Hocquard and V. Borozan, N. Cohen, J.C. Chang, N. Narayanan, R. Naserasr. 
LieuSalle 178 
OrateurPetru Valicov 

Aucun document lié à cet événement.

Retour à l'index