8 citations · 24 across the 10 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
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.DM2013
Clique cycle-transversals in distance-hereditary graphs
Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira +1
A cycle-transversal of a graph G is a subset T of V(G) such that T intersects every cycle of G. A clique cycle-transversal, or cct for short, is a cycle-transversal which is a cliq…