Prove that a simple planar graph has an orientation so that the in-degree of every node is at most 3. If the graph, in addition, is bipartite, then there is an orientation so that the in-degree of every node is at most 2.
Can anyone give me a hint on how to prove these two statements