13 citations · 36 across the 16 of their papers we have counts for
4 papers · 1 filter
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…
Reducing the domination number of graphs via edge contractions
Esther Galby, Paloma T. Lima, Bernard Ries
In this paper, we study the following problem: given a connected graph , can we reduce the domination number of by at least one using edge contractions, for some fixed i…
CPG graphs: Some structural and hardness results
Nicolas Champseix, Esther Galby, Andrea Munaro +1
In this paper we continue the systematic study of Contact graphs of Paths on a Grid (CPG graphs) initiated in [Deniz et al., 2018]. A CPG graph is a graph for which there exists a…
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.