scientific article; zbMATH DE number 5531977

MaRDI QIDQ3615792zbMATH OpenFDO

Authors J. Nešetřil

Publication date 24 March 2009

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• The complexity of homomorphism and constraint satisfaction problems seen from the other side
• Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem
• On the CSP Dichotomy Conjecture
• scientific article; zbMATH DE number 4162940
• CSP and Kripke Structures
• A proof of the CSP dichotomy conjecture
• The Complexity of Homomorphism Indistinguishability
• scientific article; zbMATH DE number 878894
• Dualities for Constraint Satisfaction Problems
• The complexity of homomorphisms and renamings for minimal unsatisfiable formulas

Cited in

(4)

• Dualities in full homomorphisms
• Aspects of structural combinatorics. (Graph homomorphisms and their use)
• Finite dualities, in particular in full homomorphisms
• In praise of homomorphisms

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