On the complexity of \(H\)-colouring planar graphs (Q1045065)
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: On the complexity of \(H\)-colouring planar graphs |
scientific article; zbMATH DE number 5648111
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of \(H\)-colouring planar graphs |
scientific article; zbMATH DE number 5648111 |
Statements
On the complexity of \(H\)-colouring planar graphs (English)
0 references
15 December 2009
0 references
graph homomorphism
0 references
\(H\)-colouring
0 references
planar graph
0 references
NP-completeness
0 references
