For a plane graph G=(V,E)G = (V, E) embedded in R2\mathbb{R}^2, let F(G)\mathcal{F}(G) denote the set of faces of GG. Then, GG is called a \textit{CnC_n-face-magic graph} if there exists a bijection f:V(G){1,2,,V(G)}f: V(G) \to \{1, 2, \dots, |V(G)|\} such that for any FF(G)F \in \mathcal{F}(G) with FCnF \cong C_n, the sum of all the vertex labels along CnC_n is a constant cc. In this paper, we investigate face-magic labelings of polygonal graphs.