Borodin Oleg Veniaminovich

Publications in Math-Net.Ru

1. Light $3$-paths in $3$-polytopes without adjacent triangles
   
   Sibirsk. Mat. Zh., 65:2 (2024),  249–257
2. Combinatorial structure of faces in triangulations on surfaces
   
   Sibirsk. Mat. Zh., 63:4 (2022),  796–804
3. Tight description of faces in torus triangulations with minimum degree 5
   
   Sib. Èlektron. Mat. Izv., 18:2 (2021),  1475–1481
4. All tight descriptions of major $3$-paths in $3$-polytopes without $3$-vertices
   
   Sib. Èlektron. Mat. Izv., 18:1 (2021),  456–463
5. A tight description of $3$-polytopes by their major $3$-paths
   
   Sibirsk. Mat. Zh., 62:3 (2021),  498–508
6. Heights of minor faces in 3-polytopes
   
   Sibirsk. Mat. Zh., 62:2 (2021),  250–268
7. Soft 3-stars in sparse plane graphs
   
   Sib. Èlektron. Mat. Izv., 17 (2020),  1863–1868
8. An extension of Franklin's Theorem
   
   Sib. Èlektron. Mat. Izv., 17 (2020),  1516–1521
9. All tight descriptions of $3$-paths in plane graphs with girth at least $8$
   
   Sib. Èlektron. Mat. Izv., 17 (2020),  496–501
10. All tight descriptions of $3$-paths centered at $2$-vertices in plane graphs with girth at least $6$
    
    Sib. Èlektron. Mat. Izv., 16 (2019),  1334–1344
11. Low faces of restricted degree in $3$-polytopes
    
    Sibirsk. Mat. Zh., 60:3 (2019),  527–536
12. Light minor $5$-stars in $3$-polytopes with minimum degree $5$
    
    Sibirsk. Mat. Zh., 60:2 (2019),  351–359
13. Light 3-stars in sparse plane graphs
    
    Sib. Èlektron. Mat. Izv., 15 (2018),  1344–1352
14. All tight descriptions of $3$-paths in plane graphs with girth at least $9$
    
    Sib. Èlektron. Mat. Izv., 15 (2018),  1174–1181
15. Describing neighborhoods of $5$-vertices in a class of $3$-polytopes with minimum degree $5$
    
    Sibirsk. Mat. Zh., 59:1 (2018),  56–64
16. Low and light $5$-stars in $3$-polytopes with minimum degree $5$ and restrictions on the degrees of major vertices
    
    Sibirsk. Mat. Zh., 58:4 (2017),  771–778
17. The height of faces of $3$-polytopes
    
    Sibirsk. Mat. Zh., 58:1 (2017),  48–55
18. Light neighborhoods of $5$-vertices in $3$-polytopes with minimum degree $5$
    
    Sib. Èlektron. Mat. Izv., 13 (2016),  584–591
19. Describing $4$-paths in $3$-polytopes with minimum degree $5$
    
    Sibirsk. Mat. Zh., 57:5 (2016),  981–987
20. Light and low $5$-stars in normal plane maps with minimum degree $5$
    
    Sibirsk. Mat. Zh., 57:3 (2016),  596–602
21. Heights of minor faces in triangle-free $3$-polytopes
    
    Sibirsk. Mat. Zh., 56:5 (2015),  982–987
22. Each $3$-polytope with minimum degree $5$ has a $7$-cycle with maximum degree at most $15$
    
    Sibirsk. Mat. Zh., 56:4 (2015),  775–789
23. The vertex-face weight of edges in $3$-polytopes
    
    Sibirsk. Mat. Zh., 56:2 (2015),  338–350
24. The weight of edge in 3-polytopes
    
    Sib. Èlektron. Mat. Izv., 11 (2014),  457–463
25. Combinatorial structure of faces in triangulated $3$-polytopes with minimum degree $4$
    
    Sibirsk. Mat. Zh., 55:1 (2014),  17–24
26. 2-distance 4-coloring of planar subcubic graphs
    
    Diskretn. Anal. Issled. Oper., 18:2 (2011),  18–28
27. Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most $1$
    
    Sibirsk. Mat. Zh., 52:5 (2011),  1004–1010
28. Acyclic 5-choosability of planar graphs without 4-cycles
    
    Sibirsk. Mat. Zh., 52:3 (2011),  522–541
29. Injective $(\Delta+1)$-coloring of planar graphs with girth 6
    
    Sibirsk. Mat. Zh., 52:1 (2011),  30–38
30. Acyclic 4-colorability of planar graphs without 4- and 5-cycles
    
    Diskretn. Anal. Issled. Oper., 17:2 (2010),  20–38
31. Acyclic $3$-choosability of planar graphs with no cycles of length from $4$ to $11$
    
    Sib. Èlektron. Mat. Izv., 7 (2010),  275–283
32. Acyclic 4-coloring of plane graphs without cycles of length 4 and 6
    
    Diskretn. Anal. Issled. Oper., 16:6 (2009),  3–11
33. Acyclic 3-choosability of plane graphs without cycles of length from 4 to 12
    
    Diskretn. Anal. Issled. Oper., 16:5 (2009),  26–33
34. Near-proper vertex 2-colorings of sparse graphs
    
    Diskretn. Anal. Issled. Oper., 16:2 (2009),  16–20
35. Partitioning sparse plane graphs into two induced subgraphs of small degree
    
    Sib. Èlektron. Mat. Izv., 6 (2009),  13–16
36. List 2-distance $(\Delta+2)$-coloring of planar graphs with girth 6 and $\Delta\ge24$
    
    Sibirsk. Mat. Zh., 50:6 (2009),  1216–1224
37. Высота цикла длины 4 в 1-планарных графах с минимальной степенью 5 без треугольников
    
    Diskretn. Anal. Issled. Oper., 15:1 (2008),  11–16
38. Circular $(5,2)$-coloring of sparse graphs
    
    Sib. Èlektron. Mat. Izv., 5 (2008),  417–426
39. List $2$-arboricity of planar graphs with no triangles at distance less than two
    
    Sib. Èlektron. Mat. Izv., 5 (2008),  211–214
40. Planar graphs without triangular $4$-cycles are $3$-choosable
    
    Sib. Èlektron. Mat. Izv., 5 (2008),  75–79
41. Предписанная 2-дистанционная $(\Delta+1)$-раскраска плоских графов с заданным обхватом
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 14:3 (2007),  13–30
42. Minimax degrees of quasiplane graphs without $4$-faces
    
    Sib. Èlektron. Mat. Izv., 4 (2007),  435–439
43. Decomposing a planar graph into a forest and a subgraph of restricted maximum degree
    
    Sib. Èlektron. Mat. Izv., 4 (2007),  296–299
44. Oriented 5-coloring of sparse plane graphs
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 13:1 (2006),  16–32
45. Sufficient conditions for the minimum $2$-distance colorability of plane graphs of girth $6$
    
    Sib. Èlektron. Mat. Izv., 3 (2006),  441–450
46. Planar graphs without triangles adjacent to cycles of length from $3$ to $9$ are $3$-colorable
    
    Sib. Èlektron. Mat. Izv., 3 (2006),  428–440
47. List $(p,q)$-coloring of sparse plane graphs
    
    Sib. Èlektron. Mat. Izv., 3 (2006),  355–361
48. Sufficient conditions for the 2-distance $(\Delta+1)$-colorability of planar graphs with girth 6
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 12:3 (2005),  32–47
49. An oriented colouring of planar graphs with girth at least $4$
    
    Sib. Èlektron. Mat. Izv., 2 (2005),  239–249
50. An oriented $7$-colouring of planar graphs with girth at least $7$
    
    Sib. Èlektron. Mat. Izv., 2 (2005),  222–229
51. A sufficient condition for the 3-colorability of plane graphs
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 11:1 (2004),  13–29
52. Sufficient conditions for planar graphs to be $2$-distance $(\Delta+1)$-colorable
    
    Sib. Èlektron. Mat. Izv., 1 (2004),  129–141
53. Continuation of a $3$-coloring from a $7$-face onto a plane graph without $3$-cycles
    
    Sib. Èlektron. Mat. Izv., 1 (2004),  117–128
54. $2$-distance coloring of sparse planar graphs
    
    Sib. Èlektron. Mat. Izv., 1 (2004),  76–90
55. Continuation of a 3-coloring from a 6-face to a plane graph without 3-cycles
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 10:3 (2003),  3–11
56. Strengthening Lebesgue's theorem on the structure of the minor faces in convex polyhedra
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 9:3 (2002),  29–39
57. On the continuation of a 3-coloring from two vertices in a plane graph without 3-cycles
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 9:1 (2002),  3–26
58. Estimating the Minimal Number of Colors in Acyclic -Strong Colorings of Maps on Surfaces
    
    Mat. Zametki, 72:1 (2002),  35–37
59. On the partition of a planar graph of girth 5 into an empty and an acyclic subgraph
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 8:4 (2001),  34–53
60. Minimal degrees and chromatic numbers of squares of planar graphs
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 8:4 (2001),  9–33
61. The structure of plane triangulations in terms of clusters and stars
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 8:2 (2001),  15–39
62. Distributive colorings of plane triangulations of minimum degree five
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 8:1 (2001),  3–16
63. On a structural property of plane graphs
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000),  5–19
64. Acyclic $k$-strong coloring of maps on surfaces
    
    Mat. Zametki, 67:1 (2000),  36–45
65. Acyclic coloring of 1-planar graphs
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 6:4 (1999),  20–35
66. The height of small faces in planar normal maps
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 5:4 (1998),  6–17
67. Weight of faces in plane maps
    
    Mat. Zametki, 64:5 (1998),  648–657
68. Colorings and topological representations of graphs
    
    Diskretn. Anal. Issled. Oper., 3:4 (1996),  3–27
69. Neighborhoods of edges in normal cards
    
    Diskretn. Anal. Issled. Oper., 2:3 (1995),  3–9
70. Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
    
    Mat. Zametki, 53:5 (1993),  35–47
71. Bidegree of graph and degeneracy number
    
    Mat. Zametki, 53:4 (1993),  13–20
72. A structural theorem on planar graphs and its application to coloring
    
    Diskr. Mat., 4:1 (1992),  60–65
73. Minimal weight of face in plane triangulations without 4-vertices
    
    Mat. Zametki, 51:1 (1992),  16–19
74. Joint generalization of the theorems of Lebesgue and Kotzig on the combinatorics of planar maps
    
    Diskr. Mat., 3:4 (1991),  24–27
75. On a characterization of chromatically rigid polynomials
    
    Sibirsk. Mat. Zh., 32:1 (1991),  22–27
76. Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
    
    Mat. Zametki, 48:6 (1990),  22–28
77. Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs
    
    Mat. Zametki, 46:5 (1989),  9–12
78. A proof of Grünbaum's conjecture on the acyclic $5$-colorability of planar graphs
    
    Dokl. Akad. Nauk SSSR, 231:1 (1976),  18–20


79. In memory of Dmitry Germanovich Fon-Der-Flaass
    
    Sib. Èlektron. Mat. Izv., 7 (2010),  1–4