What can we say about the faces of the embedding of a planar graph if we know something about the connectivity of the graph? It turns out that for 2-connected planar graphs, the faces are bounded by cycles. In 3-connected planar graphs, the faces are in correspondence with the non-separating induced cycles.
