activity
20202022
most citedReducing the domination number of -free graphs via one edge contraction

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

collaborators

6 papers

math.CO2022

Reducing Graph Parameters by Contractions and Deletions

Felicia Lucke, Felix Mann

We consider the following problem: for a given graph and two integers and , can we apply a fixed graph operation at most times in order to reduce a given graph param…

math.CO2022

Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number

Felicia Lucke, Felix Mann

We consider the following problem: for a given graph G and two integers k and d, can we apply a fixed graph operation at most k times in order to reduce a given graph parameter

math.CO20211 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 edges, for some fixed . We show that this can alway…

quant-ph2021

Low random duty-cycle errors in periodically-poled KTP revealed by sum-frequency generation

Felix Mann, Helen M. Chrzanowski, Sven Ramelow

Low-noise quantum frequency conversion in periodically-poled nonlinear crystals has proved challenging when the pump wavelength is shorter than the target wavelength. This is - at…

math.CO20201 cited

Reducing the domination number of -free graphs via one edge contraction

Esther Galby, Felix Mann, Bernard Ries

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

cs.DM2020

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…