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

(1, 2, 3) , (4)
1
2
3
4
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⟩
57 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More