Graph homomorphisms with infinite targets

DOI10.1016/0166-218X(94)90131-7MaRDI QIDQ1336635zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The complexity of infinite \(H\)-colouring
• scientific article; zbMATH DE number 434895
• scientific article; zbMATH DE number 4101217
• Polynomial graph-colorings
• On the complexity of H-coloring

Cites work

• scientific article; zbMATH DE number 434895 (Why is no real title available?)
• scientific article; zbMATH DE number 30749 (Why is no real title available?)
• scientific article; zbMATH DE number 866665 (Why is no real title available?)
• A note on restricted H-colouring
• Color-families are dense
• On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs
• On the complexity of H-coloring
• On the complexity of colouring by superdigraphs of bipartite graphs
• On the complexity of the general coloring problem
• Polynomial graph-colorings
• The Complexity of Colouring by Semicomplete Digraphs
• The complexity of infinite \(H\)-colouring
• The core of a graph
• The effect of two cycles on the complexity of colourings by directed graphs

Cited in

(7)

• scientific article; zbMATH DE number 4101217 (Why is no real title available?)
• scientific article; zbMATH DE number 434895 (Why is no real title available?)
• Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs
• scientific article; zbMATH DE number 4162940 (Why is no real title available?)
• On complexity of multidistance graph recognition in \(\mathbb{R}^1\)
• Hereditarily hard \(H\)-colouring problems
• Homologies are infinitely complex

This page was built for publication: Graph homomorphisms with infinite targets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336635)