A graph is called chiral if there is no orientation-reversing self-homeomorphism of S³ that carries the graph onto itself. 3-Connected graphs are characterized as intrinsically chiral (or not) in terms of whether or not certain types of graph automorphism exist.

This talk is based on a paper by Erica Flapan and Nikolai Weaver.