Article contents
Asymmetric two-colourings of graphs in S3
Published online by Cambridge University Press: 14 March 2002
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 K3,3 or K5, then G is intrinsically asymmetric. No such asymmetric two-colouring is possible for K3,3 or K5.
- Type
- Research Article
- Information
- Mathematical Proceedings of the Cambridge Philosophical Society , Volume 132 , Issue 2 , March 2002 , pp. 267 - 280
- Copyright
- 2002 Cambridge Philosophical Society
- 1
- Cited by