HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Some Rainbow Problems in Graphs Have Complexity Equivalent to Satisfiability Problems

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-02916921
Contributor : Antoine Lobstein Connect in order to contact the contributor
Submitted on : Monday, November 30, 2020 - 3:00:20 PM
Last modification on : Monday, January 24, 2022 - 8:26:34 AM
Long-term archiving on: : Monday, March 1, 2021 - 7:22:28 PM

File

OH-AL-TROPical.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02916921, version 1

Citation

Olivier Hudry, Antoine Lobstein. Some Rainbow Problems in Graphs Have Complexity Equivalent to Satisfiability Problems. International Transactions in Operational Research, Wiley, inPress. ⟨hal-02916921⟩

Share

Metrics

Record views

93

Files downloads

75