Solution:
Fix an orientation of the circle, and observe that the problem is equivalent to finding the number of ways to color ten equal arcs of the circle such that each arc is one of three different colors, and any two arcs which are separated by exactly one arc are of different colors. We can consider every other arc, so we are trying to color just five arcs so that no two adjacent arcs are of the same color. This is independent from the coloring of the other five arcs.
Let ai be the number of ways to color i arcs in three colors so that no two adjacent arcs are the same color. Note that a1=3 and a2=6. We claim that ai+ai+1=3⋅2i for i≥2. To prove this, observe that ai counts the number of ways to color i+1 points in a line so that no two adjacent points are the same color, and the first and (i+1)th points are the same color. Meanwhile, ai+1 counts the number of ways to color i+1 points in a line so that no two adjacent points are the same color, and the first and (i+1)th points are different colors. Then ai+ai+1 is the number of ways to color i+1 points in a line so that no two adjacent points are the same color. There are clearly 3⋅2i ways to do this, as we pick the colors from left to right, with 3 choices for the first color and 2 for the rest. We then compute a3=6, a4=18, a5=30. Then we can color the whole original circle by picking one of the 30 possible colorings for each of the two sets of 5 alternating arcs, for 302=900 total.
Now, we must consider the rotational symmetry. If a configuration has no rotational symmetry, then we have counted it 10 times. If a configuration has 180∘ rotational symmetry, then we have counted it 5 times. This occurs exactly when we have picked the same coloring from our 30 for both choices, and in exactly one particular orientation, so there are 30 such cases. Having 72∘ or 36∘ rotational symmetry is impossible, as arcs with exactly one arc between them must be different colors. Then after we correct for overcounting our answer is
10900−30+530=93