Cost colourings of hypergraphs

Some aspects of the cost colouring of hypergraphs are considered in the paper. A generalisation of the well-known Brook's theorem for a cost colouring of hypergraphs is proved. Moreover, a relation between the minimal cost of a colouring of a hypergraph with a set of costs which produce an arithmetic sequence and a number of edges of this hypergraph is investigated.