Maximal outerplanar graphs with perfect face-independent vertex covers (Q1336632)

Let \(G = (V, E)\) be a 2-connected planar graph, embedded in the plane. A subset \(W \subseteq V\) is called perfect face-independent vertex cover (FIVC) of \(G\) if every face of \(G\) has exactly one vertex in \(W\). The main result characterizes those maximal outerplanar graphs which admit plane embeddings with perfect FIVCs.