Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

A reconfigurations analogue of Brooks’ theorem.

Feghali, C. and Johnson, M. and Paulusma, D. (2014) 'A reconfigurations analogue of Brooks’ theorem.', in 39th International Symposium, MFCS 2014, Budapest, Hungary, 26-29 August 2014 ; proceedings, Part II. Berlin, Heidelberg: Springer, pp. 287-298. Lecture notes in computer science. (8635).

Abstract

Let G be a simple undirected graph on n vertices with maximum degree Δ. Brooks’ Theorem states that G has a Δ-colouring unless G is a complete graph, or a cycle with an odd number of vertices. To recolour G is to obtain a new proper colouring by changing the colour of one vertex. We show that from a k-colouring, k > Δ, a Δ-colouring of G can be obtained by a sequence of O(n 2) recolourings using only the original k colours unless G is a complete graph or a cycle with an odd number of vertices, or k = Δ + 1, G is Δ-regular and, for each vertex v in G, no two neighbours of v are coloured alike. We use this result to study the reconfiguration graph R k (G) of the k-colourings of G. The vertex set of R k (G) is the set of all possible k-colourings of G and two colourings are adjacent if they differ on exactly one vertex. It is known that if k ≤ Δ(G), then R k (G) might not be connected and it is possible that its connected components have superpolynomial diameter, if k ≥ Δ(G) + 2, then R k (G) is connected and has diameter O(n 2). We complete this structural classification by settling the missing case: if k = Δ(G) + 1, then R k (G) consists of isolated vertices and at most one further component which has diameter O(n 2). We also describe completely the computational complexity classification of the problem of deciding whether two k-colourings of a graph G of maximum degree Δ belong to the same component of R k (G) by settling the case k = Δ(G) + 1. The problem is O(n 2) time solvable for k = 3, PSPACE-complete for 4 ≤ k ≤ Δ(G), O(n) time solvable for k = Δ(G) + 1, O(1) time solvable for k ≥ Δ(G) + 2 (the answer is always yes).

Item Type:Book chapter
Full text:(AM) Accepted Manuscript
Download PDF
(288Kb)
Status:Peer-reviewed
Publisher Web site:http://dx.doi.org/10.1007/978-3-662-44465-8_25
Publisher statement:The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-44465-8_25
Date accepted:No date available
Date deposited:16 January 2015
Date of first online publication:2014
Date first made open access:No date available

Save or Share this output

Export:
Export
Look up in GoogleScholar