... The authors wish to thank the anonymous referees who drew theirattention to [9], Lemma 5.5 of [14], and for their invaluable comments. Also, they wish to thank M. Alishahi and M. Iradmusa for ... and P. Hell, Universality of A-mote graphs, European J. Combinatorics,14 (1993), 23–27.[10] G. Hahn and C. Tardif, Graph homomorphisms: structure and symmetry, in Gra phSymmetry, G. Hahn and ... w, x} and edgeset {uv, vw, wx} such that u and x have the sa me color. Consider two vertices (uv)s and (xw)s. It was shown that colors of (uv)s and (xw)sshould be the same as u and x,...