Dominating sets of maximal outerplanar graphs.

Abstract: A dominating set of a graph is a set such that each vertex is either in the set or adjacent to a vertex in the set. We show that if is an -vertex maximal outerplanar graph with having vertices of degree , then has a dominating set of size at most , by a simple coloring method. [Copyright &y& Elsevier]