Connectedness of the graph of vortex-colourings

Abstract

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

Similar works

Full text

thumbnail-image

LSE Research Online

redirect
Last time updated on 10/02/2012

This paper was published in LSE Research Online.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.