92 citations · 608 across the 67 of their papers we have counts for
4 papers · 1 filter
Long induced paths and forbidden patterns: Polylogarithmic bounds
Julien Duron, Louis Esperet, Jean-Florent Raymond
Consider a graph with a long path . When is it the case that also contains a long induced path? This question has been investigated in general as well as within a number…
Local certification of geometric graph classes
Oscar Defrain, Louis Esperet, Aurélie Lagoutte +2
The goal of local certification is to locally convince the vertices of a graph that satisfies a given property. A prover assigns short certificates to the vertices of the g…
Locally identifying coloring of graphs
Louis Esperet, Sylvain Gravier, Mickael Montassier +2
We introduce the notion of locally identifying coloring of a graph. A proper vertex-coloring c of a graph G is said to be locally identifying, if for any adjacent vertices u and v…
Frugal Colouring of Graphs
Omid Amini, Louis Esperet, Jan Van Den Heuvel
A -frugal colouring of a graph is a proper colouring of the vertices of such that no colour appears more than times in the neighbourhood of a vertex. This type of co…