Geodesic
Independent sets and chromatic numbers of circle graphs
Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part VI, Tome 417 (2013), pp. 5-10

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

Let the vertices of a circle graph be divided into several groups. This paper contains lower bounds on the size of an independent set that can be contained in one group of this subdivision. 
@article{ZNSL_2013_417_a0,
     author = {S. L. Berlov},
     title = {Independent sets and chromatic numbers of circle graphs},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {5--10},
     publisher = {mathdoc},
     volume = {417},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2013_417_a0/}
}
TY  - JOUR
AU  - S. L. Berlov
TI  - Independent sets and chromatic numbers of circle graphs
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2013
SP  - 5
EP  - 10
VL  - 417
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2013_417_a0/
LA  - ru
ID  - ZNSL_2013_417_a0
ER  - 
%0 Journal Article
%A S. L. Berlov
%T Independent sets and chromatic numbers of circle graphs
%J Zapiski Nauchnykh Seminarov POMI
%D 2013
%P 5-10
%V 417
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZNSL_2013_417_a0/
%G ru
%F ZNSL_2013_417_a0
S. L. Berlov. Independent sets and chromatic numbers of circle graphs. Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part VI, Tome 417 (2013), pp. 5-10. http://geodesic.mathdoc.fr/item/ZNSL_2013_417_a0/