Esther Galby

activity

20182026

most citedOn the Parameterized Complexity of

k

-Edge Colouring

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

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2025

Maximum list $r$ -colorable induced subgraphs in $k P_{3}$ -free graphs

Esther Galby, Paloma T. Lima, Andrea Munaro +1

We show that, for every fixed positive integers $r$ and $k$ , \textsc{Max-Weight List $r$ -Colorable Induced Subgraph} admits a polynomial-time algorithm on $k P_{3}$ -free graphs. This…

math.CO2021★ 1 cited

Using edge contractions to reduce the semitotal domination number

Esther Galby, Paloma T. Lima, Felix Mann +1

In this paper, we consider the problem of reducing the semitotal domination number of a given graph by contracting $k$ edges, for some fixed $k \geq 1$ . We show that this can alway…

math.CO2020★ 1 cited

Reducing the domination number of $P_{3} + k P_{2}$ -free graphs via one edge contraction

Esther Galby, Felix Mann, Bernard Ries

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

Maximum list r-colorable induced subgraphs in kP3​-free graphs

Using edge contractions to reduce the semitotal domination number

Reducing the domination number of P3​+kP2​-free graphs via one edge contraction

Maximum list $r$ -colorable induced subgraphs in $k P_{3}$ -free graphs

Reducing the domination number of $P_{3} + k P_{2}$ -free graphs via one edge contraction