Skip to Main content Skip to Navigation
Journal articles

Some rainbow problems in graphs have complexity equivalent to satisfiability problems

Document type :
Journal articles
Complete list of metadata

https://hal.telecom-paris.fr/hal-03466089
Contributor : Olivier Hudry Connect in order to contact the contributor
Submitted on : Saturday, December 4, 2021 - 2:03:26 PM
Last modification on : Tuesday, January 4, 2022 - 6:42:15 AM

Identifiers

  • HAL Id : hal-03466089, version 1

Citation

Olivier Hudry, Antoine Lobstein. Some rainbow problems in graphs have complexity equivalent to satisfiability problems. International Transactions in Operational Research, Wiley, 2022. ⟨hal-03466089⟩

Share

Metrics

Les métriques sont temporairement indisponibles