In a graph with 6 vertices arranged in a cycle (each vertex is connected to exactly two other vertices), each vertex must be colored with one of three colors: red, yellow, or blue, such that no two adjacent vertices share the same color. How many different ways can you color this graph? Let's think step by step and output the final answer within \boxed{}.
user