On the complexity of the labeled domination problem in graphs

In 2008, a unified approach (labeled domination) to several domination problems (k‐tuple domination, {k}‐domination, and M‐domination, among others) was introduced. The labeled domination problem is to find an L‐dominating function of minimum weight in a graph. It is an NP‐complete problem even when restricted to split graphs and bipartite graphs. On the other hand, it is known to be polynomial‐time solvable for the class of strongly chordal graphs. In this paper, we state explicit formulas that relate the domination numbers considered. These relationships allow us to enlarge the family of graphs where the labeled domination problem is polynomial‐time solvable to the class of graphs having cliquewidth bounded by a constant.