We consider the class of maximal outerplanar graphs and present a linear time algorithm for finding minimum dominating cycles of such graphs. We stress the use of a particular representation of these graphs called a recursive representation, and some linear operations on binary trees derived from these graphs.