Jones, Rhys Price (1976)
Colourings of hypergraphs.
Full text access: Open
In Chapter 2, we describe some generalized chromatic numbers of graphs. In Chapter 3, we describe how these may be regarded as chromatic numbers of associated hypergraphs. In Chapter 4, we consider some upper bounds for the chromatic number of a hypergraph, and attempt to characterize those hypergraphs for which these bounds are attained. Chapter 5 is devoted to a study of the chromatic polynomials of hypergraphs; and an algorithm for their evaluation is described. In Chapter 6, we are concerned with planar hypergraphs and some of their colouring properties. We introduce the face-chromatic number of a hypermap. Chapter 7 consists of notes on the previous chapters.
This is a Accepted version
This version's date is:
is not peer reviewed
Deposited by () on
in Royal Holloway Research Online.Last modified on 01-Feb-2017
Digitised in partnership with ProQuest, 2015-2016.
Institution: University of London, Royal Holloway College (United Kingdom).