//-->
Some rainbow problems in graphs have complexity equivalent to satisfiability problems
Hudry, Olivier, (2022)
Complexity results for identifying codes in planar graphs
Auger, David, (2010)
NP-hardness results for the aggregation of linear orders into median orders
Hudry, Olivier, (2008)