My research topics are focused on homomorphisms, graph colorings and discharging methods.
I’m interested in the oriented coloring of planar graphs. The notion of homomorhism is closely related to the notion of graph coloring, and therefore a part of the work consists to prove that, for a given graph class , every graph of admits a homomorphism to a given tournament.
The discharging method is one of the famous methods used to prove that a planar graph or a graph with bounded maximum average degree admits a given coloring. A few years ago, the notion of global discharging method was introduced: the weight can travel arbitrarily far away from the source. I am interested in this new notion.
Last update on 01/11/2018