Документ взят из кэша поисковой машины. Адрес оригинального документа : http://www.mccme.ru/dfc/2009/xtra/ivanova/Ivanova_PUBLications.pdf Дата изменения: Sun Oct 25 20:24:37 2009 Дата индексирования: Tue Nov 24 17:33:26 2009 Кодировка: Поисковые слова: m 63

..-.. ..
[I] 2009 [1] O.V. Borodin, A.O. Ivanova, A.V. Kostochka, N.N.Sheikh, Planar graphs decomposable into a forest and a matching, Discrete Math. 309 (2009) 277­279. [2] .., .., , . . . (http://semr.math.nsc.ru) 6 (2009) 13­16. [3] .., .., 2- ., . . 16, 2 (2009) 16­20. [4] O.V. Borodin, A.O. Ivanova, List 2-distance ( + 2)-coloring of planar graphs with girth six, Europ. J. Combin., 30 (2009) 1257­1262. [5] O.V.Borodin, A.O. Ivanova, A.V. Kostochka and N.N.Sheikh, Decompositions of quadrangle-free planar graphs, Discussiones Math. Graph Theory 29 (2009 ) 87­99. [6] .., .., .., (1,2)- 15, . , 16, 1 (2009) 3­6. [7] .., .., 2- ( + 2)- 6 24, . . ., . 50, no. 6, 2009. 2008 [8] .., .., .., 4 1 c 5 , . . , 2008, . 1, . 15, no 1, 11­16. [9] .., .., .., 2- , . , 2008, . 15, . 1. 20­26. [10] .., .., .., , . , 2008, . 15, . 1, 27­33. [11] O.V. Borodin, A.O. Ivanova, Planar graphs without triangular 4-cycles are 4choosable, Sibirsk. Elektron. Mat. Izv. (http://semr.math.nsc.ru) 5 (2008) 75­79. [12] .., .., 5- 5, . , 2008, . 15, . 1, 34­37.

1


[13] O.V. Borodin, A.O. Ivanova, List 2-arboricity of planar graphs with no triangles at distance less than two, Sibirsk. Elektron. Mat. Izv. (http://semr.math.nsc.ru) 5 (2008) 211­214. [14] O.V. Borodin, A.O. Ivanova, A.V. Kostochka, N.N.Sheikh, Minimax degrees of quasiplanar graphs without short cycles other than triangles, Taiwanese J. of Math. 12 (2008), no. 4, 873­886. [15] O.V. Borodin, S.G. Hartke, A.O. Ivanova, A.V. Kostochka, D.B.West, Circular (5, 2)Coloring of Sparse Graphs, Sibirsk. Elektron. Mat. Izv. http://semr.math.nsc.ru 5 (2008) 417­426. 2007 [16] .. , .. , .., 2- ( + 1)- . 2007, . 1, . 14, no 3, 13­30 [17] O.V.Borodin, A.O. Ivanova, B.S. Stechkin, Decomposing a planar graph into a forest and a subgraph of restricted maximum degree, Sibirsk. Elektron. Mat. Izv. (http://semr.math.nsc.ru) 4 (2007) 296­299. [18] O.V.Borodin, A.O. Ivanova, A.V. Kostochka and N.N.Sheikh, Minimax degrees of quasiplane graphs without 4-faces, Sibirsk. Elektron. Mat. Izv. (http://semr.math.nsc.ru) 4 (2007) 435­439. 2006 [19] .., .., .., 5- , 13, no 1 (2006) 16­32. [20] .., .., .., . . , 2006, . 13, . 1, 29­44. [21] .., .., ..,(p,q)- . . , 2006, . 13, . 2, 13­19.

[22] .., .., .., (p,q)- , . . . (http://semr.math.nsc.ru) 3 (2006) 355­361. [23] .., .., .., 2- 6, . . . (http://semr.math.nsc.ru) 3 (2006) 441­450. 2005 [24] .., .., .., 2 ( + 1)- 6, , (2005), 12, no. 3, 32­47. 2


[25] .., .., 7- 7 , . . . (http://semr.math.nsc.ru) 2 (2005) 222­229. [26] .., .., 4 , . . . (http://semr.math.nsc.ru) 2 (2005) 239­249. 2004 [27] .., .., .. , . . 2004, . 11, . 2, 30­35. [28] .., .., .., , . (http://semr.math.nsc.ru) 1 (2004) 76­90. 2- . .

[29] .., .., .., .., .., - 2- ( + 1)- , . . . (http://semr.math.nsc.ru) 1 (2004) 129­141. 2002 [30] .., .., , . , . 9, . 1, 2002, 7­12. [31] O.V.Borodin, A.O. Ivanova, Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable, J. of Graph Theory. [32] O.V. Borodin, A.O. Ivanova, 2-Distance ( + 2)-coloring of planar graphs with girth six and 18, Discrete Math. [33] .., .., 2- ( + 2)- =3, . . [34] O.V. Borodin, A.O. Ivanova, M.Montassier, and A.Raspaud, Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k . [35] O.V. Borodin, A.O. Ivanova, M Montassier, and A.Raspaud (k, 1)-coloring of sparse graphs. [36] O.V. Borodin and A.O. Ivanova, Near proper 2-choosability of sparse graphs [37] O.V. Borodin, M. Chen, A.O. Ivanova, and A. Raspaud, Acyclic 3-choosability of sparse graphs with girth at least 7. 3


[38] O.V. Borodin, A.O. Ivanova, Acyclic 5-Choosability of Planar Graphs without adjacent short cycles. [39] .., 2- ( + 2)- 12. [40] O.V. Borodin, A.O. Ivanova, Acyclic 3-choosability of planar graphs with no cycles with length from 4 to 11. [41] O.V. Borodin, A.O. Ivanova, A.Raspaud, Acyclically 4-choosable planar graphs. [42] O.V. Borodin, A.O. Ivanova, M Montassier, and A.Raspaud (k, j)-coloring of sparse graphs. [43] .., 2- ( + 2)- 4 12. [II] [44] .., .. , .., , VI , , , 23-25 , 2008, 48­51. [45] .., .., , V , 24-28 , 2007, 55­58. [46] .., .., . . (p,q)- (p,q) , V , 24-28 , 2007, 63­64. [47] .., . . (p, q)- IV - , , : . . (, 25 -2 2006). : - . . 38­40. [48] .., .., .. . IV , , 27­31 2004 , 2004. [III] [49] 2- . . .-. 01.01.09; . 003.015.01 , , 2006. 4


[50] 2- . . .-. 01.01.09; . 003.015.01 , , 2006. [51] .., .., .., 2- . X , 50- . . . : . . I: , N 187. : - , 2006, 27­37. [IV] [52] , , . 2- 25 - 28 2003 . . . II. . 19. . , 2003// .., .., .. [53] 1 , (http://www.sitim.sitc.ru), 2002// .., .., .., .., .., .. [54] , , . 29 - 1 2001 .// .., .., .., .., .., .. [55] . : " ", - . . . , . . - . .. ; : , 2001, 52 .// .., .., .. [56] ( ),- . , . . .- , , . , : 2001, 27 .// .., .., .. [57] , (http://www.sitim.sitc.ru)// .., .., .., .. [58] ( ), (http://www.sitim.sitc.ru), .., .. [59] ( ), (http://www.sitim.sitc.ru), .., .., .. , ..-.. 5

..