Determine all connected regular planar graphs G such that the number of regions in a planar embedding of G equals its order.
I am not sure how to approach this problem. I know the solution involves Euler's identity (n - m + r = 2), and I know it is only a property of connected graphs with planar embeddings. I also realize that n = r in this situation. Any ideas on how to approach this?