\input zb-basic
\input zb-ioport
\iteman{io-port 05556179}
\itemau{Fukuda, Tomotaka; Negami, Seiya; Tucker, Thomas W.}
\itemti{3-connected planar graphs are 2-distinguishable with few exceptions.}
\itemso{Yokohama Math. J. 54, No. 2, 143-153 (2008).}
\itemab
Summary: A graph is said to be 2-distinguishable if there is a subset $S\subset V(G)$ such that any automorphism $\sigma :G\to G$ with $\sigma(S) = S$ must be the identity map over $G$. We shall prove that every 3-connected planar graph is 2-distinguishable, except $K_4$, $K_{2,2,2}$, $Q_3$, $W_4$, $W_5$, $C_3 + \overline K_2$ and $C_5 + \overline K_2$.
\itemrv{~}
\itemcc{}
\itemut{distinguishing number; planar graphs}
\itemli{}
\end