Geodesic
On the entropy minimal hereditary classes of coloured graphs
Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 5, pp. 19-25

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Keywords: hereditary class, entropy, entropy minimal class. 
@article{DA_2009_16_5_a1,
     author = {V. E. Alekseev and S. V. Sorochan},
     title = {On the entropy minimal hereditary classes of coloured graphs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {19--25},
     publisher = {mathdoc},
     volume = {16},
     number = {5},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2009_16_5_a1/}
}
TY  - JOUR
AU  - V. E. Alekseev
AU  - S. V. Sorochan
TI  - On the entropy minimal hereditary classes of coloured graphs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2009
SP  - 19
EP  - 25
VL  - 16
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2009_16_5_a1/
LA  - ru
ID  - DA_2009_16_5_a1
ER  - 
%0 Journal Article
%A V. E. Alekseev
%A S. V. Sorochan
%T On the entropy minimal hereditary classes of coloured graphs
%J Diskretnyj analiz i issledovanie operacij
%D 2009
%P 19-25
%V 16
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2009_16_5_a1/
%G ru
%F DA_2009_16_5_a1
V. E. Alekseev; S. V. Sorochan. On the entropy minimal hereditary classes of coloured graphs. Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 5, pp. 19-25. http://geodesic.mathdoc.fr/item/DA_2009_16_5_a1/