Asymmetric Two-Colourings of Graphs in S³

Authors

Erica Flapan, Pomona CollegeFollow
David Linnan Li, Stanford University

Document Type

Article

Department

Mathematics (Pomona)

Publication Date

2002

Keywords

non-planar graph, intrinsic chirality, 3-connected graph

Abstract

We prove that for any non-planar graph H, we can choose a two-colouring G of H such that G is intrinsically chiral, and if H is 3-connected and is not K_3,3 or K₅, then G is intrinsically asymmetric. No such asymmetric two-colouring is possible for K_3,3 or K₅.

Rights Information

© 2002 Cambridge Philosophical Society

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.

DOI

10.1017/S0305004101005643

Recommended Citation

ERICA FLAPAN and DAVID LINNAN LI (2002). Asymmetric two-colourings of graphs in S3. Mathematical Proceedings of the Cambridge Philosophical Society, 132, pp 267-280. doi:10.1017/S0305004101005643.