Clément Charpentier

According to our database, Clément Charpentier authored at least 12 papers between 2011 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

Game-perfect semiorientations of forests.

Stephan Andres, Clément Charpentier, Wai Fong

Discuss. Math. Graph Theory, 2022

2020

A connected version of the graph coloring game.

Clément Charpentier, Hervé Hocquard, Éric Sopena, Xuding Zhu

Discret. Appl. Math., 2020

Homomorphisms of Sparse Signed Graphs.

Clément Charpentier, Reza Naserasr, Éric Sopena

Electron. J. Comb., 2020

2019

On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers.

Clément Charpentier, Simone Dantas, Celina M. H. de Figueiredo, Ana Luísa C. Furtado, Sylvain Gravier

Discret. Math., 2019

2018

On the game coloring index of -decomposable graphs.

Clément Charpentier, Brice Effantin, Gabriela Paris

Discret. Appl. Math., 2018

2017

Trinque problem: covering complete graphs by plane degree-bounded hypergraphs.

Clément Charpentier, Sylvain Gravier, Thomas Lecorre

J. Comb. Optim., 2017

The coloring game on planar graphs with large girth, by a result on sparse cactuses.

Clément Charpentier

Discret. Math., 2017

2015

The incidence game chromatic number of (a, d)-decomposable graphs.

Clément Charpentier, Éric Sopena

J. Discrete Algorithms, 2015

2014

Coloration, jeux et marquages dans les graphes. (Colorings, games and markings in graphs).

Clément Charpentier

PhD thesis, 2014

2013

L(p, q)-labeling of sparse graphs.

Clément Charpentier, Mickaël Montassier, André Raspaud

J. Comb. Optim., 2013

Incidence Coloring Game and Arboricity of Graphs.

Clément Charpentier, Éric Sopena

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2011

Minmax degree of graphs (Extended abstract).

Clément Charpentier, Mickaël Montassier, André Raspaud

Electron. Notes Discret. Math., 2011