Showing 2021Show all
3 papers · 1 filter
cs.DM2021
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
Laurent Beaudou, Caroline Brosse, Oscar Defrain +4
The Grundy number of a graph is the maximum number of colours used by the "First-Fit" greedy colouring algorithm over all vertex orderings. Given a vertex ordering $σ= v_1,\dots,v_…
cs.DM2021
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…
cs.DS2021
Polynomial delay algorithm for minimal chordal completions
Caroline Brosse, Vincent Limouzy, Arnaud Mary
Motivated by the problem of enumerating all tree decompositions of a graph, we consider in this article the problem of listing all the minimal chordal completions of a graph. In \c…