Evènement pour le groupe GT Graphes et Applications

Date 2012-01-13  14:00-15:00
TitreStrong chromatic index of planar graphs with large girth 
RésuméLet $G$ be a graph. A {em strong $k$-edge-coloring} of $G$ is a mapping from $E(G)$ to ${1,ldots,k}$ such that every two adjacent edges or two edges adjacent to a same edge receive two distinct colors. We will give the sketch of the proof of the existence of a linear function $c(Delta)$ such that every planar graph with maximum degree $Delta$ and girth at least $c(Delta)$ is strong $(2Delta-1)$-edge colorable, that is best possible (in terms of number of colors) as soon as G contains two adjacent vertices of degree $Delta$.  
LieuSalle 178 
OrateurAndré Raspaud 

Aucun document lié à cet événement.

Retour à l'index