Symmetry breaking in planar and maximal outerplanar graphs
Symmetry breaking in planar and maximal outerplanar graphs
The distinguishing number (index) [Formula: see text] ([Formula: see text]) of a graph [Formula: see text] is the least integer [Formula: see text] such that [Formula: see text] has a vertex (edge) labeling with [Formula: see text] labels that is preserved only by a trivial automorphism. In this paper, we …