20 citations · 27 across the 5 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…