Improper colourings of graphs

We consider a generalisation of proper vertex colouring of graphs, referred to as improper colouring, in which each vertex can only be adjacent to a bounded number t of vertices with the same colour, and we study this type of graph colouring problem in several different settings. The thesis is divid...

Full description

Bibliographic Details
Main Author: Kang, Ross J.
Other Authors: McDiarmid, Colin J. H.
Published: University of Oxford 2008
Subjects:
511
Online Access:http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.491626