On the entropy minimal hereditary classes of coloured graphs

We consider hereditary classes of graphs with coloured edges. The class is called entropy minimal if it does not contain proper hereditary subclasses having the same entropy value (logarithmic density). It is known for simple graphs that, for arbitrary fixed $a$ and $b$, the class consisting of all graphs admitting a partition by $a$ cliques and $b$ independent sets is entropy minimal. We prove a generalization of this statement for coloured graphs. Bibl. 5.