doi:10.1007/s40840-020-01068-6engClaverol, M.García, A.Hernández, G.Hernando, C.Maureso, M.Mora, M.Tejel, J.Metric Dimension of Maximal Outerplanar GraphsART-2021-123367In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if β(G) denotes the metric dimension of a maximal outerplanar graph G of order n, we prove that 2≤β(G)≤⌈2n5⌉ and that the bounds are tight. We also provide linear algorithms to decide whether the metric dimension of G is 2 and to build a resolving set S of size ⌈2n5⌉ for G. Moreover, we characterize all maximal outerplanar graphs with metric dimension 2.2021http://zaguan.unizar.es/record/10959910.1007/s40840-020-01068-6http://zaguan.unizar.es/record/109599oai:zaguan.unizar.es:109599info:eu-repo/grantAgreement/EC/H2020/734922/EU/Combinatorics of Networks and Computation/CONNECTThis project has received funding from the European Union’s Horizon 2020 research and innovation program under grant agreement No H2020 734922-CONNECTBulletin of the Malaysian Mathematical Sciences Society 44 (2021), 2603–2630All rights reservedhttp://www.europeana.eu/rights/rr-f/info:eu-repo/semantics/openAccess