Face-hitting Dominating Sets in Planar Graphs

P. Francis, Abraham M. Illickan, Lijo M. Jose +1

A dominating set of a graph $G$ is a subset $S$ of its vertices such that each vertex of $G$ not in $S$ has a neighbor in $S$. A face-hitting set of a plane graph $G$ is a set $T$…