Enumerating minimal dominating sets in triangle-free graphs

10/01/2018
by   Marthe Bonamy, et al.
0

It is a long-standing open problem whether the minimal dominating sets of a graph can be enumerated in output-polynomial time. In this paper we prove that this is the case in triangle-free graphs. This answers a question of Kanté et al. Additionally, we show that deciding if a set of vertices of a bipartite graph can be completed into a minimal dominating set is a NP-complete problem.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset