# Tag Info

1 vote

### Graph Injective-Homomorphism Problem

If the homomorphism from a graph $G$ to a graph $H$ is injective, then $G$ is isomorphic to a subgraph of $H$. An injective homomorphism is called a monomorphism. Perhaps you can search for research ...
• 1,005
Accepted

### Graph Injective-Homomorphism Problem

As D.W. mentioned, $G$ is injective-homomorphic to $H$ if and only if $G$ is isomorphic to a subgraph of $H$. That is why you are "unable to find a single research paper on 'injective-...
• 32.8k
Morandini, NP-complete problem: partition into triangles shows that the following problem is NP-complete: Given a tripartite graph $G$ on $3n$ vertices (given together with a tripartition), determine ...