Counting Outerplanar Maps

摘要

A map is outerplanar if all its vertices lie in the outer face.?We enumerate various classes of rooted outerplanar maps with respect to the number of edges and vertices. The proofs involve several bijections with lattice paths. As a consequence of our results, we obtain an efficient scheme for encoding simple outerplanar maps.