Complexity dichotomy for oriented homomorphism of planar graphs with large girth - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Theoretical Computer Science Year : 2015

Complexity dichotomy for oriented homomorphism of planar graphs with large girth

Guillaume Guégan
  • Function : Author
  • PersonId : 1165626
Pascal Ochem

Dates and versions

lirmm-01263869 , version 1 (28-01-2016)

Identifiers

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⟩
90 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More