In graph theory we are interested in classical problems in their most recent developments and we introduce new research directions. Our expertise in graph theory lies in particular in problems related to Hamiltonism, colorations, and the calculation of invariants. The notion of oriented coloring, for example, was introduced and developed at the LaBRI and is now widely studied in the international community. Our work also covers the analysis of general graph parameters and more highly structured graphs (planar, bounded tree width, ...), the calculation of compact routing tables, distance labelling, algorithms for communications, graph coding, graph games.