Given a graph G, an exact r-coloring of G is a surjective functionAn arithmetic progression is rainbow if all of the vertices are colored distinctly. The fewest number of colors that guarantees a rainbow arithmetic progression of length three is called the anti-van der Waerden number of G and is denoted aw(G, 3). It is known that 3 ≤ aw(G H, 3) ≤ 4. Here we determine exact values aw(T T ′ , 3) for some trees T and T ′ , determine aw(G T, 3) for some trees T , and determine aw(G H, 3) for some graphs G and H.