scholarly journals Some rainbow problems in graphs have complexity equivalent to satisfiability problems

Author(s):  
Olivier Hudry ◽  
Antoine Lobstein
2013 ◽  
Vol 123 (1) ◽  
pp. 59-76 ◽  
Author(s):  
Robert Ganian ◽  
Petr Hliněný ◽  
Jan Obdržálek

Author(s):  
Aristotelis Giannakos ◽  
Laurent Gourvès ◽  
Jérôme Monnot ◽  
Vangelis Th. Paschos

Sign in / Sign up

Export Citation Format

Share Document