Location of Repository

Connectedness of the graph of vortex-colourings

By Luis Cereceda, Jan van den Heuvel and Matthew Johnson


For a positive integer k and a graph G, the k-colour graph of G, Ck(G), is the graph that has the proper k-vertex-colourings of G as its vertex set, and two k-colourings are joined by an edge in Ck(G) if they differ in colour on just one vertex of G. In this note some results on the connectivity of Ck(G) are proved. In particular it is shown that if G has chromatic number k 2 {2, 3}, then Ck(G) is not connected. On the other hand, for k ¸ 4 there are graphs with chromatic number k for which Ck(G) is not connected, and there are k-chromatic graphs for which Ck(G) is connected

Topics: QA Mathematics
Publisher: Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science
Year: 2005
OAI identifier: oai:eprints.lse.ac.uk:13886
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.cdam.lse.ac.uk (external link)
  • http://eprints.lse.ac.uk/13886... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.