An oriented 7-colouring of planar graphs with girth at least 7. Borodin, O.V.; Ivanova, A.O. — 2005 Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
List 2-distance ( Δ + 2 ) -coloring of planar graphs with girth 6 and Δ ≥ 24 . Borodin, O.V.; Ivanova, A.O. — 2009 Sibirskij Matematicheskij Zhurnal
An oriented colouring of planar graphs with girth at least 4. Borodin, O.V.; Ivanova, A.O. — 2005 Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
2-distance coloring of sparse planar graphs. Borodin, O.V.; Ivanova, A.O.; Neustroeva, T.K. — 2004 Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6. Borodin, O.V.; Ivanova, A.O.; Neustroeva, T.K. — 2006 Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
List ( p , q ) -coloring of sparse plane graphs. Borodin, O.V.; Ivanova, A.O.; Neustroeva, T.K. — 2006 Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Decomposing a planar graph into a forest and a subgraph of restricted maximum degree. Borodin, O.V.; Ivanova, A.O.; Stechkin, B.S. — 2007 Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Minimax degrees of quasiplane graphs without 4-faces. Borodin, O.V.; Ivanova, A.O.; Kostochka, A.V.; Sheikh, N.N. — 2007 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]