$C_{2k+1}$-coloring of bounded-diameter graphs

Marta Piecyk

For a fixed graph $H$, in the graph homomorphism problem, denoted by $Hom(H)$, we are given a graph $G$ and we have to determine whether there exists an edge-preserving mapping $φ:…