Asymmetric two-colourings of graphs in S3
2002 ◽
Vol 132
(2)
◽
pp. 267-280
◽
Keyword(s):
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.
1996 ◽
Vol 54
◽
pp. 440-441
Keyword(s):
Keyword(s):
2012 ◽
Vol 04
(04)
◽
pp. 1250047
◽
1989 ◽
Vol 72
(10)
◽
pp. 55-67
2012 ◽
Vol 33
(3)
◽
pp. 380-396
◽
2000 ◽
pp. 821-831
◽
Keyword(s):