Cours privé toulousain depuis 1980
[Mathématiques, Physique-Chimie, Informatique]
Clément Charpentier, PhD.
My research is in Graph Theory, Combinatorial Game Theory and the intersection of those fields. Although I am interested in algorithmic questions, most of my research has been devoted to the study of structural properties of graphs.
My main interests are graph coloring problems and their two-player game counterpart. I am also currently working on graph homomorphisms and Cop & Robber on graphs.
After a few-years-long break from mathematics, during which I passed a Bachelor degree in Psychology, I am currently working as a full-time private math tutor in Toulouse, France.
This independant position allows me to get back to my research interests, both by taste and in order to maintain the level of mathematical skills and knowledge required in my trade.
Research Homepage
[In Construction]
Publications
[2022] Game-perfect semiorientations of forests ; with Dominique Andres and William Wai Lam Fong.
Discusiones Mathematicae Graph Theory, Vol. 42(2).
[2020] Homomorphisms of Sparse Signed Graphs ; with Reza Naserasr and Éric Sopena.
The Electronic Journal of Combinatorics, Vol. 27(3).[2020] A Connected Version of the Graph Coloring Game ; with Hervé Hocquard, Éric Sopena and Xuding Zhu. Discrete Applied Mathematics, Vol. 283(9).
[2019] On Nordhaus–Gaddum type inequalities for the game chromatic and game coloring numbers ;
with Simone Dantas, Celina M. H. de Figueiredo, Ana Furtado and Sylvain Gravier.Discrete Mathematics, Vol. 342(5).
[2018] On the game coloring index of F+-decomposable graphs ; with Brice Effantin and Gabriela Paris.
Discrete Applied Mathematics, Vol. 236.
[2017] The Coloring Game on Planar Graphs with Large Girth, by a result on Sparse Cactuses.
Discrete Mathematics, Vol. 340(5).
[2017] Trinque problem ; with Sylvain Gravier and Thomas Lecorre.
Journal of Combinatorial Optimization, Vol. 33, 2017.[2015] The incidence game chromatic number of (a,d)-decomposable graphs ; with Éric Sopena.
Journal of Discrete Algorithms, Vol. 31.
[2013] Incidence Coloring Game and Abroricity of Graphs ; with Éric Sopena.
Combinatorial Algorithms. IWOCA 2013. Lecture Notes in Computer Science, vol 8288.
[2013] L(p,q)-labeling of sparse graphs ; with Mickael Montassier and André Raspaud.
Journal of Combinatorial Optimization, Vol. 25.
[2011] Minmax degree of graphs (Extended abstract) ; with Mickael Montassier and André Raspaud.
Electronic Notes in Discrete Mathematics, Vol. 38.
Faculty Positions
[2015-2016] IUT Lumière Lyon 2. ATER (Non-Tenured Teaching and Research Fellow).
Full-time TA, mainly in Databases at technical-degree-level for the STID (Statistics and Decision Computing) department.
Research fellow at the DISP-lab (Decision and Information Systems for Production Systems), in the team Research, Transfer & Innovation, under the supervision of Yacine Ozrout.
[2014-2015] Université Joseph Fourier, Grenoble. ATER.
Full-time TA, mainly in Databases at Master-degree-level in the IM²AG (Informatics, Mathematics & Applied Maths in Grenoble) department.
Research fellow at the Institut Fourier in the Combinatorics & Didactics team, under the supervision of Sylvain Gravier.
Où nous trouver...
38bis, rue Roquelaine, 31500 Toulouse.
à 5min du métro Jeanne d'Arc et de la gare Matabiau
Nous contacter
Mathématiques, du Collège à la Première
Théo Hennequin [06 15 76 18 65][teohennequin@gmail.com]Mathématiques Terminale & Supérieur / Informatique
Clément Charpentier [06 52 76 36 05][charpentier.enseignement@gmail.com]Physique-Chimie
André Peyralans [07 83 81 62 87][andre.peyralans@gmail.com]