Colourings of hypergraphs

Abstract

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.