Path partitions of planar graphs. Glebov, A.N.; Zambalaeva, D.Zh. — 2007 Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Continuation of a 3-coloring from a 7-face onto a plane graph without C 3 . Aksenov, V.A.; Borodin, O.V.; Glebov, A.N. — 2004 Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable. Borodin, O.V.; Glebov, A.N.; Jensen, Tommy R.; Raspaud, Andre — 2006 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]