scientific article; zbMATH DE number 4162940

MaRDI QIDQ3490042zbMATH OpenFDO

Authors Alain Quilliot

Publication date 1990

zbMATH Keywords

complexitycontinuous structurediscretizationfixed pointhomomorphism problemspursuit games problem

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• The complexity of infinite \(H\)-colouring
• scientific article; zbMATH DE number 434895
• The complexity of restricted graph homomorphisms
• The complexity of surjective homomorphism problems-a survey
• Graph homomorphisms with infinite targets

Cited in

(14)

• Weak near-unanimity functions and digraph homomorphism problems
• Complexity dichotomy for oriented homomorphism of planar graphs with large girth
• The complexity of counting homomorphisms to cactus graphs modulo 2
• The complexity of homomorphism and constraint satisfaction problems seen from the other side
• scientific article; zbMATH DE number 5531977 (Why is no real title available?)
• Nonuniform complexity classes, decision graphs and homological properties of posets
• scientific article; zbMATH DE number 1996252 (Why is no real title available?)
• scientific article; zbMATH DE number 5265 (Why is no real title available?)
• Bi‐arc graphs and the complexity of list homomorphisms
• scientific article; zbMATH DE number 7297854 (Why is no real title available?)
• Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs
• New plain-exponential time classes for graph homomorphism
• On the complexity of some problems related to graph extensions
• The complexity of pursuit on a graph

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