Let G be a planar graph with edges colored red and blue. Show that there is a vertex $x$ such that going around the edges incident to $x$ in clockwise order we encounter no more than two changes of color.
How do you attack such a problem? Is it by induction?