On the complexity of \(H\)-colouring planar graphs
type: Item
instance of: scholarly article
title: On the complexity of \(H\)-colouring planar graphs
zbMATH Open document ID: 1213.05094
author: Mark Siggers
author: Gary MacGillivray
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5648111
zbMATH Keywords: graph homomorphism
zbMATH Keywords: \(H\)-colouring
zbMATH Keywords: planar graph
zbMATH Keywords: NP-completeness
MaRDI profile type: Publication
full work available at URL: j.disc.2008.05.016
OpenAlex ID: W2024156610
cites work: Q3097395
cites work: Acyclic Homomorphisms and Circular Colorings of Digraphs
cites work: Q4198056
cites work: Q4828516
cites work: On the complexity of H-coloring
cites work: Algorithmic complexity of list colorings
cites work: Tree-depth, subgraph coloring and homomorphism bounds
DOI: 10.1016/J.DISC.2008.05.016
description: scientific article; zbMATH DE number 5648111