Location of Repository

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:To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.