scientific article; zbMATH DE number 1151810

MaRDI QIDQ4387718zbMATH OpenFDO

Authors Peter Dukes, H. Emerson, Gary MacGillivray

Publication date 13 May 1998

zbMATH Keywords

\(H\)-colouringundecidable

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
• The complexity of infinite \(H\)-colouring
• scientific article; zbMATH DE number 434895
• Graph homomorphisms with infinite targets

Cited in

(8)

• Dichotomies for classes of homomorphism problems involving unary functions
• Building blocks for the variety of absolute retracts
• scientific article; zbMATH DE number 434895 (Why is no real title available?)
• scientific article; zbMATH DE number 512918 (Why is no real title available?)
• scientific article; zbMATH DE number 2080268 (Why is no real title available?)
• scientific article; zbMATH DE number 2226733 (Why is no real title available?)
• Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$
• The fine-grained complexity of graph homomorphism parameterized by clique-width

This page was built for publication:

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