Complexity dichotomy for oriented homomorphism of planar graphs with large girth (Q2355705)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity dichotomy for oriented homomorphism of planar graphs with large girth |
scientific article; zbMATH DE number 6463997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity dichotomy for oriented homomorphism of planar graphs with large girth |
scientific article; zbMATH DE number 6463997 |
Statements
Complexity dichotomy for oriented homomorphism of planar graphs with large girth (English)
0 references
24 July 2015
0 references
oriented homomorphism
0 references
planar graph
0 references
NP-completeness
0 references
0.92429084
0 references
0.91794294
0 references
0.8987151
0 references
0.8963962
0 references
0.89422786
0 references
0.89160657
0 references
0.88997674
0 references
