Complexity dichotomy for oriented homomorphism of planar graphs with large girth

Guillaume Guégan; Pascal Ochem

doi:10.1016/j.tcs.2015.06.041

Journal Articles Theoretical Computer Science Year : 2015

Complexity dichotomy for oriented homomorphism of planar graphs with large girth

(1) , (1)

1

Guillaume Guégan

Function : Author
PersonId : 1165626

Algorithmes, Graphes et Combinatoire

Pascal Ochem

Function : Author
PersonId : 7098
IdHAL : pascal-ochem
ORCID : 0000-0001-5504-4586
IdRef : 109150902

Algorithmes, Graphes et Combinatoire

CV

Keywords

Oriented homomorphism Planar NP-completeness

Domains

Discrete Mathematics [cs.DM]

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

Dates and versions

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

Identifiers

HAL Id : lirmm-01263869 , version 1
DOI : 10.1016/j.tcs.2015.06.041

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS ALGCO LIRMM TDS-MACS MIPS UNIV-MONTPELLIER

94 View

0 Download

Complexity dichotomy for oriented homomorphism of planar graphs with large girth

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share