Some Rainbow Problems in Graphs Have Complexity Equivalent to Satisfiability Problems
Résumé
In a vertex-coloured graph, a set of vertices S is said to be a rainbow set if every colour in the graph appears exactly once in S. We investigate the complexities of various problems dealing with domination in vertex-coloured graphs (existence of rainbow dominating sets, of rainbow locating-dominating sets, of rainbow identifying sets), including when we ask for a unique solution: we show equivalence between these complexities and those of the well-studied Boolean satisfiability problems.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|