Graph homomorphisms with infinite targets

DOI10.1016/0166-218X(94)90131-7zbMath0812.68101OpenAlexW2062163926MaRDI QIDQ1336635

Gary MacGillivray

Publication date: 3 November 1994

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

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90131-7

zbMATH Keywords

\(H\)-colouringfixed 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)

Related Items

Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs ⋮ On complexity of multidistance graph recognition in \(\mathbb{R}^1\) ⋮ Hereditarily hard \(H\)-colouring problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of colouring by superdigraphs of bipartite graphs
• The core of a graph
• The effect of two cycles on the complexity of colourings by directed graphs
• On the complexity of H-coloring
• Color-families are dense
• Polynomial graph-colorings
• A note on restricted \(H\)-colouring
• The complexity of infinite \(H\)-colouring
• 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