For graphs G and H, an H-coloring of G is an edge-preserving mapping
fro...
We study the 3-Coloring problem in graphs with small diameter. In
2013, ...
For graphs G,H, a homomorphism from G to H is an edge-preserving
mapping...
A homomorphism from a graph G to a graph H is an edge-preserving mapping...