Library Header Image
LSE Research Online LSE Library Services

Connectedness of the graph of vortex-colourings

Cereceda, Luis, van den Heuvel, Jan ORCID: 0000-0003-0897-9148 and Johnson, Matthew (2005) Connectedness of the graph of vortex-colourings. CDAM research report series (CDAM-LSE-2005-11). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Full text not available from this 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.

Item Type: Monograph (Report)
Official URL:
Additional Information: © 2005 the authors
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 27 Oct 2008 14:18
Last Modified: 16 May 2024 13:09

Actions (login required)

View Item View Item