4 citations · 7 across the 4 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
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 , can we reduce the domination number of by at least one using edge contractions, for some fixed i…
cs.CC2018
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width
Esther Galby, Andrea Munaro, Bernard Ries
A semitotal dominating set of a graph with no isolated vertex is a dominating set of such that every vertex in is within distance two of another vertex in . The…
cs.CC2017★ 1 cited
Critical Vertices and Edges in -free Graphs
Daniël Paulusma, Christophe Picouleau, Bernard Ries
A vertex or edge in a graph is critical if its deletion reduces the chromatic number of the graph by 1. We consider the problems of deciding whether a graph has a critical vertex o…