Symmetry breaking in planar and maximal outerplanar graphs

The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a vertex (edge) labeling with d labels that is preserved only by a trivial automorphism. In this p...