Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
Knowledge based object programming tools were studied [1-7]. Formal technology dependent grammar differentiation and integration… 
1994
1994
In this thesis we will study various aspects of homomorphisms of infinite digraphs with emphasis on cores and compactness. We…