Dominating maximal outerplane graphs and Hamiltonian plane triangulations

Michael D. Plummer, Dong Ye, Xiaoya Zha

Let $G$ be a graph and $\gamma (G)$ denote the domination number of $G$, i.e. the cardinality of a smallest set of vertices $S$ such that every vertex of $G$ is either in $S$ or adjacent…