Complexity of Metric Dimension on Planar Graphs

Josep Diaz, Olli Pottonen, Maria Serna +1

The metric dimension of a graph $G$ is the size of a smallest subset $L\subseteq V(G)$ such that for any $x,y\in V(G)$ with $x\ne y$ there is a $z\in L$ such that the graph di…