Hostname: page-component-848d4c4894-p2v8j Total loading time: 0.001 Render date: 2024-05-15T07:18:18.370Z Has data issue: false hasContentIssue false
  • English
  • Français

Asymmetric two-colourings of graphs in S3

Published online by Cambridge University Press:  14 March 2002

ERICA FLAPAN  and
DAVID LINNAN LI
ERICA FLAPAN
Affiliation:
Department of Mathematics, Pomona College, Claremont, CA 91711, U.S.A. e-mail: eflapan@pomona.edu
DAVID LINNAN LI
Affiliation:
Department of Mathematics, Stanford University, Stanford, CA 94305, U.S.A. e-mail: daveli@leland.stanford.edu
Get access Rights & Permissions [Opens in a new window]

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)