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.
@article{10_37236_6249,
author = {Ivan Geffner and Marc Noy},
title = {Counting outerplanar maps},
journal = {The electronic journal of combinatorics},
year = {2017},
volume = {24},
number = {2},
doi = {10.37236/6249},
zbl = {1361.05065},
url = {http://geodesic.mathdoc.fr/articles/10.37236/6249/}
}
TY - JOUR
AU - Ivan Geffner
AU - Marc Noy
TI - Counting outerplanar maps
JO - The electronic journal of combinatorics
PY - 2017
VL - 24
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.37236/6249/
DO - 10.37236/6249
ID - 10_37236_6249
ER -
%0 Journal Article
%A Ivan Geffner
%A Marc Noy
%T Counting outerplanar maps
%J The electronic journal of combinatorics
%D 2017
%V 24
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/6249/
%R 10.37236/6249
%F 10_37236_6249
Ivan Geffner; Marc Noy. Counting outerplanar maps. The electronic journal of combinatorics, Tome 24 (2017) no. 2. doi: 10.37236/6249
