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. ITOR, 29(3):1547-1572, 2022. [doi]

Abstract

Abstract is missing.