Special orientation of planar graph
Source: Romania TST 1 2012, Problem 4
May 3, 2012
inductioncombinatorics proposedcombinatorics
Problem Statement
Prove that a finite simple planar graph has an orientation so that every vertex has out-degree at most 3.