Use this URL to cite or link to this record in EThOS:
Title: Mixing graph colourings
Author: Cereceda, Luis
ISNI:       0000 0004 2672 0161
Awarding Body: London School of Economics and Political Science (LSE)
Current Institution: London School of Economics and Political Science (University of London)
Date of Award: 2007
Availability of Full Text:
Access from EThOS:
Access from Institution:
This thesis investigates some problems related to graph colouring, or. more precisely. graph re-colouring. Informally, the basic question addressed can be phrased as follows. Suppose one is given a graph G whose vertices can be properly k-coloured. for some k > 2. Is it possible to transform any k-colouring of G into any other by recolouring vertices of G one at a time, making sure a proper k-colouring of G is always maintained? If the answer is in the affirmative, G is said to be k-mixing. The related problem of deciding whether, given two k-colourings of G7 it is possible to transform one into the other by recolouring vertices one at a time, always maintaining a proper k-colouring of G, is also considered. These questions can be considered as having a hearing on certain mathematical and "real-world" problems. In particular, being able to recolour any colouring of a given graph to any other colouring is a necessary pre-requisite for the method of sampling colourings known as Glauber dynamics. The results presented in this thesis may also find application in the context of frequency reassignment: given that the problem of assigning radio frequencies in a wireless communications network is often modelled as a graph colouring problem. the task of re-assigning frequencies in such a network can be thought of as a graph recolouring problem. Throughout the thesis. the emphasis is 011 the algorithmic aspects and the computational complexity of the questions described above. In other words, how easily. in terms of computational resources used, can they be answered? Strong results are obtained for the k = 3 case of the first question, where a characterisation theorem for 3-mixing graphs is given. For the second question. a dichotomy theorem for the complexity of the problem is proved: the problem is solvable in polynomial time for k < 3 and PSPACE-complete for k > 4. In addition, the possible length of a shortest sequence of recolourings between two colourings is investigated, and an interesting connection between the tractability of the problem and its underlying structure is established. Some variants of the above problems are also explored.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: QA Mathematics