1 citations · 1 across the 4 of their papers we have counts for
4 papers
On Modular Edge Colourings of Graphs
Gaétan Berthe, Marthe Bonamy, Fábio Botler +5
Given a graph and an integer , let denote the minimum number of colours required to colour the edges of such that, in each colour class, the subgraph ind…
An Objective Improvement Approach to Solving Discounted Payoff Games
Daniele Dell'Erba, Arthur Dumas, Sven Schewe
While discounted payoff games and classic games that reduce to them, like parity and mean-payoff games, are symmetric, their solutions are not. We have taken a fresh view on the pr…
An Objective Improvement Approach to Solving Discounted Payoff Games
Daniele Dell'Erba, Arthur Dumas, Sven Schewe
While discounted payoff games and classic games that reduce to them, like parity and mean-payoff games, are symmetric, their solutions are not. We have taken a fresh view on the co…
The Maker-Maker domination game in forests
Eric Duchêne, Arthur Dumas, Nacim Oijid +2
We study the Maker-Maker version of the domination game introduced in 2018 by Duchêne et al. Given a graph, two players alternately claim vertices. The first player to claim a domi…