4 citations · 6 across the 5 of their papers we have counts for
4 papers · 1 filter
The complexity of blocking (semi)total dominating sets with edge contractions
Esther Galby
We consider the problem of reducing the (semi)total domination number of graph by one by contracting edges. It is known that this can always be done with at most three edge contrac…
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.