9 citations · 11 across the 17 of their papers we have counts for
5 papers · 1 filter
An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs
Clara Marcille, Nacim Oijid
A monitoring edge-geodetic set (or meg-set for short) of a graph is a set of vertices such that if any edge is removed, then the distance between some two vertices of incre…
Token positional games
Guillaume Bagan, Quentin Deschamps, Florian Galliot +2
The classical Maker-Breaker positional game is played on a board which is a hypergraph , with two players, Maker and Breaker, alternately claiming vertices of $\mathca…
On the complexity of the Maker-Breaker happy vertex game
Mathieu Hilaire, Perig Montfort, Nacim Oijid
Given a c-colored graph G, a vertex of G is happy if it has the same color as all its neighbors. The notion of happy vertices was introduced by Zhang and Li to compute the homophil…
Fast winning strategies for the attacker in eternal domination
Guillaume Bagan, Nicolas Bousquet, Nacim Oijid +1
Dominating sets in graphs are often used to model some monitoring of the graph: guards are posted on the vertices of the dominating set, and they can thus react to attacks occurrin…
Generalising the achromatic number to Zaslavsky's colourings of signed graphs
Julien Bensmail, François Dross, Nacim Oijid +1
The chromatic number, which refers to the minimum number of colours required to colour the vertices of graphs properly, is one of the most central notions of the graph chromatic th…