On the lower bound for the chromatic number of graphs with given maximal degree and girth.
Tashkinov, V.A.
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only], Tome 1 (2004), p. 99-109 / Harvested from The Electronic Library of Mathematics
Full (PDF)
Publié le : 2004-01-01
EUDML-ID : urn:eudml:doc:51821 
@article{02237533,
     title = {On the lower bound for the chromatic number of graphs with given maximal degree and girth.},
     journal = {Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]},
     volume = {1},
     year = {2004},
     pages = {99-109},
     zbl = {1076.05038},
     language = {en},
     url = {http://dml.mathdoc.fr/item/02237533}
}

Tashkinov, V.A. On the lower bound for the chromatic number of graphs with given maximal degree and girth.. Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only], Tome 1 (2004) pp. 99-109. http://gdmltest.u-ga.fr/item/02237533/