Enumerating Minimal Dominating Sets in Triangle-Free Graphs
Résumé
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.
| Origine | Fichiers éditeurs autorisés sur une archive ouverte |
|---|
Loading...
