Recommendations
Cites work
- Colored graphs without colorful cycles
- Colouring, constraint satisfaction, and complexity
- Duality theorems for finite structures (characterising gaps and good characterisations)
- Forbidden lifts (NP and CSP for combinatorialists)
- From graph coloring to constraint satisfaction: there and back again
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
- scientific article; zbMATH DE number 3711961 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 863494 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- On classes of relations and graphs determined by subobjects and factorobjects
- On realizations of point determining graphs, and obstructions to full homomorphisms
- Ramsey-type theorems with forbidden subgraphs
- Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
- Some new good characterizations for directed graphs
Cited in
(10)- Gaps in full homomorphism order
- Point determining digraphs, \(\{ 0,1 \}\)-matrix partitions, and dualities in full homomorphisms
- Graph partitions with prescribed patterns
- Join colourings of chordal graphs
- scientific article; zbMATH DE number 5610941 (Why is no real title available?)
- Finite dualities, in particular in full homomorphisms
- Full-homomorphisms to paths and cycles
- Generalisations of matrix partitions: complexity and obstructions
- Right-adjoints for Datalog programs
- Connected obstructions to full graph homomorphisms
This page was built for publication: Dualities in full homomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1041189)