On the restricted homomorphism problem
type: Item
instance of: scholarly article
title: On the restricted homomorphism problem
zbMATH Open document ID: 1151.68042
author: Richard C. Brewster
author: Timothy Graves
published in: Discrete Applied Mathematics
publication date: 2008-10-17T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 5353576
zbMATH Keywords: digraph homomorphism
zbMATH Keywords: restricted homomorphism
zbMATH Keywords: hereditary hardness
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.dam.2007.03.028
OpenAlex ID: W2028416100
cites work: Hereditarily hard \(H\)-colouring problems
cites work: A note on restricted \(H\)-colouring
cites work: Q4211739
cites work: The complexity of restricted graph homomorphisms
cites work: The chromatic number of the product of two 4-chromatic graphs is 4
cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
cites work: Pair Labellings with Given Distance
cites work: On the Complexity of Ordered Colorings
cites work: On the complexity of the circular chromatic number
cites work: On the complexity of H-coloring
cites work: Q4828516
cites work: Density via duality.
cites work: Duality theorems for finite structures (characterising gaps and good characterisations)
cites work: Circular chromatic number: A survey
cites work: The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
DOI: 10.1016/J.DAM.2007.03.028
description: scientific article; zbMATH DE number 5353576