Some rainbow problems in graphs have complexity equivalent to satisfiability problems - Archive ouverte HAL Access content directly
Journal Articles International Transactions in Operational Research Year : 2022

Some rainbow problems in graphs have complexity equivalent to satisfiability problems

Domains

Computer Science [cs] Computational Complexity [cs.CC]

Olivier Hudry  : Connect in order to contact the contributor

https://hal.telecom-paris.fr/hal-03466089

Submitted on : Saturday, December 4, 2021-2:03:26 PM

Last modification on : Thursday, March 9, 2023-10:30:17 AM

Not file

Dates and versions

hal-03466089 , version 1 (04-12-2021)

Identifiers

  • HAL Id : hal-03466089 , version 1

Cite

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

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

INSTITUT-TELECOM CNRS INRIA CENTRALESUPELEC UNIV-PARIS-SACLAY LTCI INFRES IP_PARIS LISN GS-ENGINEERING GS-COMPUTER-SCIENCE C2
40 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More