Complexity dichotomy for oriented homomorphism of planar graphs with large girth

Guillaume Guégan 1 Pascal Ochem 1
1 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Document type :
Journal articles
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01263869
Contributor : Pascal Ochem <>
Submitted on : Thursday, January 28, 2016 - 12:50:54 PM
Last modification on : Friday, April 12, 2019 - 10:18:09 AM

Identifiers

Collections

Citation

Guillaume Guégan, Pascal Ochem. Complexity dichotomy for oriented homomorphism of planar graphs with large girth. Theoretical Computer Science, Elsevier, 2015, 596, pp.142-148. ⟨10.1016/j.tcs.2015.06.041⟩. ⟨lirmm-01263869⟩

Share

Metrics

Record views

133