Article dans une revue, GALaC, Computer Science, Informatique
Some Rainbow Problems in Graphs Have Complexity Equivalent to Satisfiability Problems
Olivier Hudry, Antoine Lobstein. Some Rainbow Problems in Graphs Have Complexity Equivalent to Satisfiability Problems. International Transactions in Operational Research, 2022, 29 (3), pp.1547-1572. ⟨hal-02916921⟩
