A two-connected plane graph of order at least three is maximal exactly when every face is triangular

Let $f$ be a face of $G$. By [L2] its boundary walk is a cycle $C$, drawn as a polygon. By [L5] every frontier point of $f$ in the relative interior of an edge puts that whole edge in the frontier, so $\operatorname{Fr}(f)$ is exactly the point set of $C$. Now $f$ is connected and disjoint from $C$, so it lies in one region $R_0$ of $C$ [L1, L4]; $f$ is open, and $\overline f\cap R_0=(f\cup C)\cap R_0=f$, so $f$ is also closed in $R_0$. A nonempty clopen subset of the connected $R_0$ is all of it, so the face is one of the two regions of its own boundary cycle.

If instead every face is triangular, the interior of any proposed new plane edge is connected and disjoint from the drawing, so it lies in one face, with both endpoints on that face's boundary [L4]. Those endpoints are already adjacent because that boundary is a triangle, so no missing edge can be added.

The two regions of a polygon $P$ carry different crossing parities. Fix a point $p$ in the relative interior of one of the finitely many segments making up $P$, so $p$ is not a vertex, and by [L6] take a disc $D$ about $p$ small enough to meet $P$ only in that segment. Then $D\setminus P$ is two open half-discs, each connected and disjoint from $P$ and so contained in a single region [L4]; by [L1] there are exactly two regions and each has frontier $P\ni p$, so each meets $D$, and therefore the two half-discs lie in different regions. Only finitely many directions fail to be in general position for $P$ [L3], and only the two directions along the segment fail to meet it transversely, so some direction $d$ avoids both finite sets. Put $q=p-\varepsilon d$ and $q'=p+\varepsilon d$ with $\varepsilon$ small enough that both lie in $D$; since $d$ is not along the segment, $q$ and $q'$ lie in the two different half-discs, and $[q,q']$ meets $P$ only at $p$. The ray from $q$ in direction $d$ is $[q,q']$ followed by the ray from $q'$ in direction $d$, so its crossing count is that of the latter plus the single transverse crossing at $p$. Both rays are in general position, so by [L3] those counts are the parities of $q$ and of $q'$, which therefore differ; and parity is constant on each region [L3].

Let $u$ be a vertex of $C$. By [L6] a small enough disc $D$ about $u$ contains no other vertex and meets the drawing only in initial straight segments of the finitely many edges at $u$. Deleting those segments leaves finitely many open sectors of $D$, each connected and disjoint from the drawing and hence inside a single face [L4]. Since $u\in\operatorname{Fr}(f)$, points of $f$ lie in every disc about $u$, so one sector $S$ satisfies $S\subseteq f$, and the straight radius from $u$ into $S$ meets the drawing only at $u$.

Let $u\ne v$ be vertices of $C$, with radii as in step 2.1 and inner endpoints $u',v'\in f$. By step 1.1 $f$ is a region, hence an open connected plane set and polygonally connected [L4], so a polygonal path joins $u'$ to $v'$ inside $f$; discarding the portion between the first and last visit to each repeated point makes it simple. Concatenating the two radii with it gives a polygonal arc from $u$ to $v$ meeting the drawing only at $u$ and $v$. If $u$ and $v$ are nonadjacent in $G$, drawing the edge $uv$ along that arc keeps the drawing plane, so $G$ is not maximal plane.

Suppose now $G$ is maximal plane and some facial boundary cycle $C$ has length at least four. Let $u_1,u_2,u_3,u_4$ occur in this cyclic order on $C$ and let $P_1,P_2$ be the two $u_1$–$u_3$ subpaths of $C$, with $u_2$ on $P_1$ and $u_4$ on $P_2$. Both pairs are nonconsecutive on $C$, so by step 3.1 $u_1u_3$ and $u_2u_4$ are edges of $G$, neither an edge of $C$; write $e,e'$ for their arcs. They share no endpoint, so by [L6] the relative interior of each avoids $C$ and the other, and both avoid $f$ because they are part of the drawing. Hence $J_1=e\cup P_1$ and $J_2=e\cup P_2$ are polygons.

From any point off $C\cup e$ there is a ray meeting that finite union of segments transversely in finitely many nonvertex points, by the finiteness count of [L3], and one such ray is in general position for $C$, $e$, $J_1$ and $J_2$ at once. Its crossings with $J_1$ plus its crossings with $J_2$ equal its crossings with $C$ plus twice its crossings with $e$, so those three parities satisfy $J_1+J_2=C$ modulo two at every point off $C\cup e$. Now $f$ avoids $C$, $J_1$ and $J_2$ and is connected, so all three parities are constant on it, say $p_1$, $p_2$ and $p_1+p_2$. The relative interior of $e'$ is connected and also avoids $J_1$ and $J_2$, so its $J_1$- and $J_2$-parities are constant. Its endpoint $u_4$ is off $J_1$ and lies in $\operatorname{Fr}(f)$ by step 1.1, so a neighbourhood of $u_4$ off $J_1$ carrying a constant parity [L3] meets both $f$ and that relative interior, forcing the $J_1$-parity along $e'$ to be $p_1$; symmetrically $u_2\notin J_2$ forces the $J_2$-parity to be $p_2$. The $C$-parity along $e'$ is then $p_1+p_2$, that of $f$. The two regions of $C$ carry different parities by step 1.3, so equal $C$-parity places the relative interior of $e'$ in the same region of $C$ as $f$ — which by step 1.1 is $f$ itself. That is impossible for part of the drawing, so the assumption fails and every facial boundary cycle has length three.

The order assumption excludes the one- and two-vertex degeneracies, and steps 5.1 and 1.2 prove both directions.