Geodesic
On graphs with a~large chromatic number containing no small odd cycles
Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part III, Tome 391 (2011), pp. 35-44

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

We present lower bounds for the number of vertices in a graph with a large chromatic number containing no small odd cycles. 
@article{ZNSL_2011_391_a2,
     author = {S. L. Berlov and I. I. Bogdanov},
     title = {On graphs with a~large chromatic number containing no small odd cycles},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {35--44},
     publisher = {mathdoc},
     volume = {391},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2011_391_a2/}
}
TY  - JOUR
AU  - S. L. Berlov
AU  - I. I. Bogdanov
TI  - On graphs with a~large chromatic number containing no small odd cycles
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2011
SP  - 35
EP  - 44
VL  - 391
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2011_391_a2/
LA  - ru
ID  - ZNSL_2011_391_a2
ER  - 
%0 Journal Article
%A S. L. Berlov
%A I. I. Bogdanov
%T On graphs with a~large chromatic number containing no small odd cycles
%J Zapiski Nauchnykh Seminarov POMI
%D 2011
%P 35-44
%V 391
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZNSL_2011_391_a2/
%G ru
%F ZNSL_2011_391_a2
S. L. Berlov; I. I. Bogdanov. On graphs with a~large chromatic number containing no small odd cycles. Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part III, Tome 391 (2011), pp. 35-44. http://geodesic.mathdoc.fr/item/ZNSL_2011_391_a2/