+12 the question: Let it be G a planar graph, 3-colorable, in which every face is triangle (including the outer face). prove that G contains euler circuit.
so, I have tried to prove that for some v vertex of G his degree is even, but I didn't succeed.
How can I prove it?
