Skip to main content

Theorems and computations in circular colourings of graphs

Resource type
Thesis type
(Thesis) Ph.D.
Date created
The circular chromatic number provides a more refined measure of colourability of graphs, than does the ordinary chromatic number. Thus circular colouring is of substantial importance wherever graph colouring is studied or applied, for example, to scheduling problems of periodic nature. Precisely, the circular chromatic number of a graph G is the smallest ratio p/q of positive integers p and q for which there exists a mapping c:V(G)->{1,2,...,p} such that q
Copyright statement
Copyright is held by the author.
The author has not granted permission for the file to be printed nor for the text to be copied and pasted. If you would like a printable copy of this thesis, please contact
Scholarly level
Member of collection
Download file Size
etd3278.pdf 3.59 MB

Views & downloads - as of June 2023

Views: 0
Downloads: 1