4 citations · 7 across the 4 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
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 edges, for some fixed . We show that this can alway…
math.CO2020★ 1 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…
math.CO2018
Detecting strong cliques
Ademir Hujdurović, Martin Milanič, Bernard Ries
A strong clique in a graph is a clique intersecting every maximal independent set. We study the computational complexity of six algorithmic decision problems related to strong cliq…