Intrinsic chirality of complete graphs.
Proc. Amer. Math. Soc. 115 (1992), 233-236.
A graph is said to be intrinsically chiral if no embedding of the graph in
3-space is respected by any ambient orientation-reversing homeomorphism.
In this note, we characterize those complete graphs that are intrinsically
chiral. (with Erica Flapan)
Return to publication list