Journal Articles
Theoretical Computer Science
Year : 2015
Pascal Ochem : Connect in order to contact the contributor
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01263869
Submitted on : Thursday, January 28, 2016-12:50:54 PM
Last modification on : Tuesday, September 3, 2024-1:56:20 PM
Cite
Guillaume Guégan, Pascal Ochem. Complexity dichotomy for oriented homomorphism of planar graphs with large girth. Theoretical Computer Science, 2015, 596, pp.142-148. ⟨10.1016/j.tcs.2015.06.041⟩. ⟨lirmm-01263869⟩
94
View
0
Download