Connected obstructions to full graph homomorphisms
type: Item
instance of: scholarly article
title: Connected obstructions to full graph homomorphisms
zbMATH Open document ID: 1300.05181
author: Pavol Hell
author: A. Pultr
published in: European Journal of Combinatorics
publication date: 2014-09-02T00:00:00Z
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 6338832
zbMATH Keywords: minimal connected obstructions
MaRDI profile type: Publication
full work available at URL: j.ejc.2014.04.009
OpenAlex ID: W1997694836
cites work: Ramsey-type theorems with forbidden subgraphs
cites work: Dualities in full homomorphisms
cites work: Full Constraint Satisfaction Problems
cites work: On realizations of point determining graphs, and obstructions to full homomorphisms
cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
cites work: Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
cites work: Q3424890
cites work: Q4828516
cites work: Colouring, constraint satisfaction, and complexity
cites work: Some new good characterizations for directed graphs
cites work: Q5639839
cites work: On classes of relations and graphs determined by subobjects and factorobjects
cites work: Duality theorems for finite structures (characterising gaps and good characterisations)
cites work: Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
cites work: Point determination in graphs
DOI: 10.1016/J.EJC.2014.04.009
description: scientific article; zbMATH DE number 6338832