Graph Colouring and Frequency Assignment

Tools

Waters, Robert James (2005) Graph Colouring and Frequency Assignment. PhD thesis, University of Nottingham.

[thumbnail of waters-thesis.pdf]
Preview
 PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (619kB) | Preview

Abstract

In this thesis we study some graph colouring problems which arise from mathematical models of frequency assignment in radiocommunications networks, in particular from models formulated by Hale and by Tesman in the 1980s.

The main body of the thesis is divided into four chapters. Chapter 2 is the shortest, and is largely self-contained; it contains some early work on the frequency assignment problem, in which each edge of a graph is assigned a positive integer weight, and an assignment of integer colours to the vertices is sought in which the colours of adjacent vertices differ by at least the weight of the edge joining them.

The remaining three chapters focus on problems which combine frequency assignment with list colouring, in which each vertex has a list of integers from which its colour must be chosen. In Chapter 3 we study list colourings where the colours of adjacent vertices must differ by at least a fixed integer s, and in Chapter 4 we add the additional restriction that the lists must be sets of consecutive integers. In both cases we investigate the required size of the lists so that a colouring can always be found.

By considering the behaviour of these parameters as s tends to infinity, we formulate continuous analogues of the two problems, considering lists which are real intervals in Chapter 4, and arbitrary closed real sets in Chapter 5. This gives rise to two new graph invariants, the consecutive choosability ratio tau(G) and the choosability ratio sigma(G). We relate these to other known graph invariants, provide general bounds on their values, and determine specific values for various classes of graphs.

Item Type: Thesis (University of Nottingham only) (PhD)
Supervisors: Woodall, Douglas R.
Keywords: graph theory, graph colouring, graph coloring, combinatorics, frequency assignment
Subjects: Q Science > QA Mathematics > QA150 Algebra
Faculties/Schools: UK Campuses > Faculty of Science > School of Mathematical Sciences
Item ID: 10135
Depositing User: EP, Services
Date Deposited: 16 Nov 2005
Last Modified: 15 Oct 2017 13:58
URI: https://eprints.nottingham.ac.uk/id/eprint/10135

Actions (Archive Staff Only)

Edit View Edit View