The problem of a graph covering with convex sets is investigated. It is shown that this problem may be reduced to a problem of a hipergraph colouring. JEL: C65
In this article, necessary and sufficient conditions are given in which a set of a metric space is represented as a union of a finite number of convex sets. JEL: C65 Miscellaneous Mathematical Tools