Intrinsic chirality of complete graphs
HTML articles powered by AMS MathViewer
- by Erica Flapan and Nikolai Weaver
- Proc. Amer. Math. Soc. 115 (1992), 233-236
- DOI: https://doi.org/10.1090/S0002-9939-1992-1112490-5
- PDF | Request permission
Abstract:
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.References
- J. H. Conway and C. McA. Gordon, Knots and links in spatial graphs, J. Graph Theory 7 (1983), no. 4, 445–453. MR 722061, DOI 10.1002/jgt.3190070410
- Erica Flapan, Symmetries of Möbius ladders, Math. Ann. 283 (1989), no. 2, 271–283. MR 980598, DOI 10.1007/BF01446435
Bibliographic Information
- © Copyright 1992 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 115 (1992), 233-236
- MSC: Primary 05C10; Secondary 57M25
- DOI: https://doi.org/10.1090/S0002-9939-1992-1112490-5
- MathSciNet review: 1112490