//-->
Complexity results for identifying codes in planar graphs
Auger, David, (2010)
Some rainbow problems in graphs have complexity equivalent to satisfiability problems
Hudry, Olivier, (2022)
A smallest tournament for which the Banks set and the Copeland set are disjoint
Hudry, Olivier, (1999)