Clément Charpentier

Learn More
The square G of a graph G is the graph obtained from G by adding an edge between every pair of vertices having a common neighbor. A proper coloring of G is also called a 2-distance coloring of G. The maximum average degree Mad(G) of a graph G is the maximum among the average degrees of the subgraphs of G, i.e. Mad(G) = max { 2|E(H)| V (H) |H ⊆ G } . Graphs(More)
The incidence coloring game has been introduced in [S.D. Andres, The incidence game chromatic number, Discrete Appl. Math. 157 (2009), 1980– 1987] as a variation of the ordinary coloring game. The incidence game chromatic number ιg(G) of a graph G is the minimum number of colors for which Alice has a winning strategy when playing the incidence coloring game(More)
Coding Guide Example: MOAA01 (Weekday) MO (Session type) AA (Session order) 01 Weekdays: SU (Sunday), MO (Monday), TU (Tuesday), WE (Wednesday), TH (Thursday), FR (Friday) Session types: oral abstract sessions AA (Track A), AB (Track B), AC (Track C), AD (Track D), AE (Track E), AX (Cross-Track), LBA (Late Breaker Track A), LBB (Late Breaker Track B), LBC(More)
We denote by χg(G) the game chromatic number of a graph G, which is the smallest number of colors Alice needs to win the coloring game on G. We know from Montassier et al. [M. Montassier, P. Ossona de Mendez, A. Raspaud and X. Zhu, Decomposing a graph into forests, J. Graph Theory Ser. B, 102(1):38-52, 2012] and, independantly, from Wang and Zhang, [Y. Wang(More)
  • 1