Homomorphic equivalence

Known as: Homomorphically-equivalent

In the mathematics of graph theory, two graphs, G and H, are called homomorphically equivalent if there exists a graph homomorphism and a graph…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2012

The problem of deciding whether CSP instances admit solutions has been deeply studied in the literature, and several structural…

2006

We fully characterise the situations where the existence of a homomorphism from a digraph G to at least one of a finite set of…

2006

Knowledge based object programming tools were studied [1-7]. Formal technology dependent grammar differentiation and integration…

1997

1994

In this thesis we will study various aspects of homomorphisms of infinite digraphs with emphasis on cores and compactness. We…