Dualities in full homomorphisms

DOI10.1016/j.ejc.2009.04.004zbMath1219.05092OpenAlexW2089411554MaRDI QIDQ1041189

Jaroslav Nešetřil, Richard N. Ball, Ales Pultr

Publication date: 1 December 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.04.004

zbMATH Keywords

dualities of graphsrelational structures with respect to full homomorphisms

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

Gaps in full homomorphism order ⋮ Full-homomorphisms to paths and cycles ⋮ Graph partitions with prescribed patterns ⋮ Join colourings of chordal graphs ⋮ Connected obstructions to full graph homomorphisms ⋮ Point determining digraphs, \(\{ 0,1 \}\)-matrix partitions, and dualities in full homomorphisms

Cites Work

• Colouring, constraint satisfaction, and complexity
• Colored graphs without colorful cycles
• On classes of relations and graphs determined by subobjects and factorobjects
• Duality theorems for finite structures (characterising gaps and good characterisations)
• Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
• Forbidden lifts (NP and CSP for combinatorialists)
• On realizations of point determining graphs, and obstructions to full homomorphisms
• Some new good characterizations for directed graphs
• Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
• Ramsey-type theorems with forbidden subgraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dualities in full homomorphisms