A resolving set of a graph G is a set S ⊆ V (G), such that, every pair of distinct vertices of G is resolved by some vertex in S. The metric dimension of G, denoted by β(G), is the minimum cardinality of all the resolving sets of G. Shamir Khuller et al. [10], in 1996, proved that a graph G with β(G) = 2 can have neither K5 nor K3,3 as its subgraph. In this paper, we obtain a forbidden subgraph...