20 citations · 27 across the 5 of their papers we have counts for
6 papers
Reconfiguration of Digraph Homomorphisms
Benjamin Lévêque, Moritz Mühlenthaler, Thomas Suzan
For a fixed graph H, the H-Recoloring problem asks whether for two given homomorphisms from a graph G to H, we can transform one into the other by changing the image of a single ve…
Locating Dominating Sets in local tournaments
Thomas Bellitto, Caroline Brosse, Benjamin Lévêque +1
A dominating set in a directed graph is a set of vertices such that all the vertices that do not belong to have an in-neighbour in . A locating set is a set of verti…
Local certification of graphs on surfaces
Louis Esperet, Benjamin Lévêque
A proof labelling scheme for a graph class is an assignment of certificates to the vertices of any graph in the class , such that upon reading its certif…
Planar graphs with and no triangle adjacent to a are minimally edge and total choosable
Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
For planar graphs, we consider the problems of \emph{list edge coloring} and \emph{list total coloring}. Edge coloring is the problem of coloring the edges while ensuring that two…
Regularized path integrals and anomalies -- U(1) chiral gauge theory
Christoph Kopper, Benjamin Lévêque
We analyse the origin of the Adler anomaly of chiral U(1) gauge theory within the framework of regularized path integrals. Momentum or position space regulators allow for mathemati…
Erratum : MCColor is not optimal on Meyniel graphs
Benjamin Lévêque, Frédéric Maffray
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. In the manuscript "Coloring Meyniel graphs in linear time" we claimed that our algorithm…