The complexity of restricted graph homomorphisms
type: Item
instance of: scholarly article
title: The complexity of restricted graph homomorphisms
zbMATH Open document ID: 0873.68167
DOI: 10.1016/S0012-365X(96)00223-3
author: Richard C. Brewster
author: Pavol Hell
author: Gary MacGillivray
published in: Discrete Mathematics
publication date: 1997-10-09T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 1018509
zbMATH Keywords: non-bipartite graph
zbMATH Keywords: digraphs
MaRDI profile type: Publication
cites work: The Complexity of Colouring by Semicomplete Digraphs
cites work: Hereditarily hard \(H\)-colouring problems
cites work: The complexity of infinite \(H\)-colouring
cites work: Q5422499
cites work: A note on restricted \(H\)-colouring
cites work: Pair Labellings with Given Distance
cites work: On multiplicative graphs and the product conjecture
cites work: On the complexity of H-coloring
cites work: The core of a graph
cites work: The Existence of Homomorphisms to Oriented Cycles
cites work: On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs
cites work: On the complexity of the general coloring problem
cites work: The Categorical Product of Graphs
cites work: Q3912037
full work available at URL: s0012-365x(96)00223-3
OpenAlex ID: W2014735387
Wikidata QID: Q127956983
description: scientific article; zbMATH DE number 1018509