4 citations · 7 across the 4 of their papers we have counts for
4 papers · 1 filter
Blocking total dominating sets via edge contractions
Esther Galby, Felix Mann, Bernard Ries
In this paper, we study the problem of deciding whether the total domination number of a given graph can be reduced using exactly one edge contraction (called 1-Edge Contractio…
Blocking dominating sets for -free graphs via edge contractions
Esther Galby, Paloma T. Lima, Bernard Ries
In this paper, we consider the following problem: given a connected graph , can we reduce the domination number of by one by using only one edge contraction? We show that th…
On the Parameterized Complexity of -Edge Colouring
Esther Galby, Paloma T. Lima, Daniël Paulusma +1
For every fixed integer , we prove that -Edge Colouring is fixed-parameter-tractable when parameterized by the number of vertices of maximum degree.
Dominating induced matchings in graphs containing no long claw
Alain Hertz, Vadim Lozin, Bernard Ries +2
An induced matching in a graph is dominating if every edge not in shares exactly one vertex with an edge in . The dominating induced matching problem (also known as…