The scaling limit of random outerplanar maps

A planar map is outerplanar if all its vertices belong to the same face. We show that random uniform outerplanar maps with n vertices suitably resealed by a factor 1/root n converge in the Gromov-Hausdorff sense to 7 root 2/9 times Aldous' Brownian tree. The proof uses the bijection of Bonichon, Gavoille and Hanusse (J. Graph Algorithms Appl. 9 (2005) 185-204).