Connected obstructions to full graph homomorphisms

DOI10.1016/j.ejc.2014.04.009zbMath1300.05181OpenAlexW1997694836MaRDI QIDQ740288

Pavol Hell, Ales Pultr

Publication date: 2 September 2014

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

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

zbMATH Keywords

minimal connected obstructions

Mathematics Subject Classification ID

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

Related Items

Gaps in full homomorphism order

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Colouring, constraint satisfaction, and complexity
• Dualities in full homomorphisms
• 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
• On realizations of point determining graphs, and obstructions to full homomorphisms
• Point determination in graphs
• Some new good characterizations for directed graphs
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Full Constraint Satisfaction Problems
• Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
• Ramsey-type theorems with forbidden subgraphs