A. Brandstädt

activity

20112021

most citedDominating Induced Matchings for P7-Free Graphs in Linear Time

8 citations · 24 across the 10 of their papers we have counts for

collaborators

Showing cs.DMShow all

19 papers · 1 filter

cs.DM2021★ 2 cited

Finding Efficient Domination for $P_{8}$ -Free Bipartite Graphs in Polynomial Time

Andreas Brandstädt, Raffaele Mosca

A vertex set $D$ in a finite undirected graph $G$ is an {\em efficient dominating set} (\emph{e.d.s.}\ for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex o…

cs.DM2020

Finding Efficient Domination for $S_{1, 1, 5}$ -Free Bipartite Graphs in Polynomial Time

Andreas Brandstädt, Raffaele Mosca

A vertex set $D$ in a finite undirected graph $G$ is an {\em efficient dominating set} (e.d.s.\ for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex of $D$ .…

cs.DM2020

Finding Efficient Domination for $S_{1, 3, 3}$ -Free Bipartite Graphs in Polynomial Time

Andreas Brandstädt, Raffaele Mosca

A vertex set $D$ in a finite undirected graph $G$ is an {\em efficient dominating set} (\emph{e.d.s.}\ for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex o…

cs.DM2019

Finding Dominating Induced Matchings in $P_{9}$ -Free Graphs in Polynomial Time

Andreas Brandstädt, Raffaele Mosca

Let $G = (V, E)$ be a finite undirected graph. An edge subset $E^{'} \subseteq E$ is a {\em dominating induced matching} ({\em d.i.m.}) in $G$ if every edge in $E$ is intersected by exac…

cs.DM2019

Finding Dominating Induced Matchings in $S_{1, 1, 5}$ -Free Graphs in Polynomial Time

Andreas Brandstädt, Raffaele Mosca

Let $G = (V, E)$ be a finite undirected graph. An edge set $E^{'} \subseteq E$ is a {\em dominating induced matching} ({\em d.i.m.}) in $G$ if every edge in $E$ is intersected by exactly…

cs.DM2017

Dominating Induced Matchings in $S_{1, 2, 4}$ -Free Graphs

Andreas Brandstädt, Raffaele Mosca

Let $G = (V, E)$ be a finite undirected graph without loops and multiple edges. A subset $M \subseteq E$ of edges is a {\em dominating induced matching} ({\em d.i.m.}) in $G$ if every…

Finding Efficient Domination for P8​-Free Bipartite Graphs in Polynomial Time

Finding Efficient Domination for S1,1,5​-Free Bipartite Graphs in Polynomial Time

Finding Efficient Domination for S1,3,3​-Free Bipartite Graphs in Polynomial Time

Finding Dominating Induced Matchings in P9​-Free Graphs in Polynomial Time

Finding Dominating Induced Matchings in S1,1,5​-Free Graphs in Polynomial Time

Dominating Induced Matchings in S1,2,4​-Free Graphs

Finding Efficient Domination for $P_{8}$ -Free Bipartite Graphs in Polynomial Time

Finding Efficient Domination for $S_{1, 1, 5}$ -Free Bipartite Graphs in Polynomial Time

Finding Efficient Domination for $S_{1, 3, 3}$ -Free Bipartite Graphs in Polynomial Time

Finding Dominating Induced Matchings in $P_{9}$ -Free Graphs in Polynomial Time

Finding Dominating Induced Matchings in $S_{1, 1, 5}$ -Free Graphs in Polynomial Time

Dominating Induced Matchings in $S_{1, 2, 4}$ -Free Graphs