Paloma T. Lima

activity

20172022

most citedOn the Parameterized Complexity of

k

-Edge Colouring

4 citations · 12 across the 12 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

cs.DM2019★ 2 cited

Blocking dominating sets for $H$ -free graphs via edge contractions

Esther Galby, Paloma T. Lima, Bernard Ries

In this paper, we consider the following problem: given a connected graph $G$ , can we reduce the domination number of $G$ by one by using only one edge contraction? We show that th…

cs.CC2019

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 $G$ , can we reduce the domination number of $G$ by at least one using $k$ edge contractions, for some fixed i…

cs.DM2019★ 4 cited

On the Parameterized Complexity of $k$ -Edge Colouring

Esther Galby, Paloma T. Lima, Daniël Paulusma +1

For every fixed integer $k \geq 1$ , we prove that $k$ -Edge Colouring is fixed-parameter-tractable when parameterized by the number of vertices of maximum degree.

Blocking dominating sets for H-free graphs via edge contractions

Reducing the domination number of graphs via edge contractions

On the Parameterized Complexity of k-Edge Colouring

Blocking dominating sets for $H$ -free graphs via edge contractions

On the Parameterized Complexity of $k$ -Edge Colouring