KURSCHAK 1978 Problem 2

The vertices of a convex $n$ -gon are colored so that adjacent vertices have different colors. Prove that if $n$ is odd, then the polygon can be divided into triangles with non-intersecting diagonals such that no diagonal has its endpoints the same color.