1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.DS2017
Contraction and Deletion Blockers for Perfect Graphs and -free Graphs
Öznur Yaşar Diner, Daniël Paulusma, Christophe Picouleau +1
We study the following problem: for given integers , and graph , can we reduce some fixed graph parameter of by at least via at most graph operations from…
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…
cs.DM2015
Dominating induced matchings in graphs containing no long claw
Alain Hertz, Vadim Lozin, Bernard Ries +2
An induced matching in a graph is dominating if every edge not in shares exactly one vertex with an edge in . The dominating induced matching problem (also known as…