Esther Galby

activity

20182025

most citedOn the Parameterized Complexity of

k

-Edge Colouring

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

collaborators

Showing 2019 · cs.DMShow all

3 papers · 2 filters

cs.DM2019

Characterising circular-arc contact $B_{0}$ -VPG graphs

Flavia Bonomo-Braberman, Esther Galby, Carolina Lucía Gonzalez

A contact $B_{0}$ -VPG graph is a graph for which there exists a collection of nontrivial pairwise interiorly disjoint horizontal and vertical segments in one-to-one correspondence wi…

cs.DM2019

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.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.

Characterising circular-arc contact B0​-VPG graphs

Blocking dominating sets for H-free graphs via edge contractions

On the Parameterized Complexity of k-Edge Colouring

Characterising circular-arc contact $B_{0}$ -VPG graphs

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

On the Parameterized Complexity of $k$ -Edge Colouring