The complexity of restricted graph homomorphisms

DOI10.1016/S0012-365X(96)00223-3zbMath0873.68167OpenAlexW2014735387WikidataQ127956983 ScholiaQ127956983MaRDI QIDQ1356452

Pavol Hell, Richard C. Brewster, Gary MacGillivray

Publication date: 9 October 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00223-3

zbMATH Keywords

digraphsnon-bipartite graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

On the restricted homomorphism problem

Cites Work

• Unnamed Item
• Unnamed Item
• The core of a graph
• On the complexity of H-coloring
• On multiplicative graphs and the product conjecture
• A note on restricted \(H\)-colouring
• The complexity of infinite \(H\)-colouring
• Hereditarily hard \(H\)-colouring problems
• Pair Labellings with Given Distance
• The Complexity of Colouring by Semicomplete Digraphs
• On the complexity of the general coloring problem
• On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs
• The Existence of Homomorphisms to Oriented Cycles
• The Categorical Product of Graphs

This page was built for publication: The complexity of restricted graph homomorphisms