Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm

Therese Biedl

In a recent paper, Francis, Illickan, Jose and Rajendraprasad showed that every $n$-vertex plane graph $G$ has (under some natural restrictions) a vertex-partition into two sets $V…