8 citations · 37 across the 21 of their papers we have counts for
4 papers · 2 filters
Dominating Induced Matchings in -Free Graphs
Andreas Brandstädt, Raffaele Mosca
Let be a finite undirected graph without loops and multiple edges. A subset of edges is a {\em dominating induced matching} ({\em d.i.m.}) in if every…
Finding Dominating Induced Matchings in -Free Graphs in Polynomial Time
Andreas Brandstädt, Raffaele Mosca
Let be a finite undirected graph. An edge set is a {\em dominating induced matching} ({\em d.i.m.}) in if every edge in is intersected by exactly…
On Chordal--Generalized Split Graphs
Andreas Brandstädt, Raffaele Mosca
A graph is a {\em chordal--generalized split graph} if is chordal and there is a clique in such that every connected component in has at most…
On Efficient Domination for Some Classes of -Free Chordal Graphs
Andreas Brandstädt, Raffaele Mosca
A vertex set in a finite undirected graph is an efficient dominating set (e.d.s. for short) of if every vertex of is dominated by exactly one vertex of . The Eff…