Skip to Main content Skip to Navigation
Journal articles

Some rainbow problems in graphs have complexity equivalent to satisfiability problems

Olivier Hudry 1, 2, 3 Antoine Lobstein 4 
1 IP Paris - Institut Polytechnique de Paris
2 INFRES - Département Informatique et Réseaux
3 C2 - Cybersécurité et Cryptographie
LTCI - Laboratoire Traitement et Communication de l'Information : 484335
4 LISN - Laboratoire Interdisciplinaire des Sciences du Numérique
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 : Sunday, June 26, 2022 - 3:22:52 AM

Identifiers

  • HAL Id : hal-03466089, version 1

Collections

INSTITUT-TELECOM | CNRS | CENTRALESUPELEC | UNIV-PARIS-SACLAY | LTCI | INFRES | IP_PARIS | LISN | GS-ENGINEERING | GS-COMPUTER-SCIENCE | C2

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⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

56