Intrinsic chirality of complete graphs
Erica Flapan and Nikolai Weaver
Proc. Amer. Math. Soc. 115 (1992), 233-236
Primary 05C10; Secondary 57M25
Similar Articles |
Abstract: A graph is said to be intrinsically chiral if no embedding of the graph in -space is respected by any ambient orientation-reversing homeomorphism. In this note, we characterize those complete graphs that are intrinsically chiral.
H. Conway and C.
McA. Gordon, Knots and links in spatial graphs, J. Graph
Theory 7 (1983), no. 4, 445–453. MR
Flapan, Symmetries of Möbius ladders, Math. Ann.
283 (1989), no. 2, 271–283. MR
Retrieve articles in Proceedings of the American Mathematical Society
Retrieve articles in all journals
© Copyright 1992
American Mathematical Society