On the lower bound for the chromatic number of graphs with given maximal degree and girth. Tashkinov, V.A. — 2004 Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Sufficient conditions for planar graphs to be 2-distance ( Δ + 1 )-colourable. Borodin, O.V.; Glebov, A.N.; Ivanova, A.O.; Neustroeva, T.K.; Tashkinov, V.A. — 2004 Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]