Ragnar Nevries

activity

20122014

most citedNew Polynomial Cases of the Weighted Efficient Domination Problem

5 citations · 6 across the 3 of their papers we have counts for

collaborators

Showing cs.DMShow all

3 papers · 1 filter

cs.DM2014★ 1 cited

Towards a Characterization of Leaf Powers by Clique Arrangements

Ragnar Nevries, Christian Rosenke

The class $L_{k}$ of $k$ -leaf powers consists of graphs $G = (V, E)$ that have a $k$ -leaf root, that is, a tree $T$ with leaf set $V$ , where $x y \in E$ , if and only if the $T$ -di…

cs.DM2013★ 5 cited

New Polynomial Cases of the Weighted Efficient Domination Problem

Andreas Brandstädt, Martin Milanic, Ragnar Nevries

Let G be a finite undirected graph. A vertex dominates itself and all its neighbors in G. A vertex set D is an efficient dominating set (e.d. for short) of G if every vertex of G i…

cs.DM2012

Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs

Andreas Brandstädt, Arne Leitert, Dieter Rautenbach

Let G=(V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v in V dominates its closed neighborhood N[v]. A vertex set D in G is an efficient domin…