2-distance (Delta+2)-coloring of planar graphs with girth six and Delta>=18. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2009)

Planar graphs decomposable into a forest and a matching. - Oleg V. Borodin; Anna O. Ivanova; Alexandr V. Kostochka; Naeem N. Sheikh (Discret. Math., 2009)

Decompositions of quadrangle-free planar graphs. - Oleg V. Borodin; Anna O. Ivanova; Alexandr V. Kostochka; Naeem N. Sheikh (Discuss. Math. Graph Theory, 2009)

List 2-distance (Delta+2)-coloring of planar graphs with girth six. - Oleg V. Borodin; Anna O. Ivanova (Eur. J. Comb., 2009)

Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable. - Oleg V. Borodin; Anna O. Ivanova (J. Graph Theory, 2009)

Acyclic 3-choosability of sparse graphs with girth at least 7. - Oleg V. Borodin; Min Chen 012; Anna O. Ivanova; André Raspaud (Discret. Math., 2010)

Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles. - Oleg V. Borodin; Anna O. Ivanova; André Raspaud (Discret. Math., 2010)

Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. - Oleg V. Borodin; Anna O. Ivanova; Mickaël Montassier; Pascal Ochem; André Raspaud (J. Graph Theory, 2010)

(k, j)-coloring of sparse graphs. - Oleg V. Borodin; Anna O. Ivanova; Mickaël Montassier; André Raspaud (Discret. Appl. Math., 2011)

List injective colorings of planar graphs. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2011)

List strong linear 2-arboricity of sparse graphs. - Oleg V. Borodin; Anna O. Ivanova (J. Graph Theory, 2011)

Acyclic 5-choosability of planar graphs without adjacent short cycles. - Oleg V. Borodin; Anna O. Ivanova (J. Graph Theory, 2011)

List 2-facial 5-colorability of plane graphs with girth at least 12. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2012)

Acyclic 4-choosability of planar graphs without adjacent short cycles. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2012)

(k, 1)-coloring of sparse graphs. - Oleg V. Borodin; Anna O. Ivanova; Mickaël Montassier; André Raspaud (Discret. Math., 2012)

2-distance 4-colorability of planar subcubic graphs with girth at least 22. - Oleg V. Borodin; Anna O. Ivanova (Discuss. Math. Graph Theory, 2012)

Describing (d-2)-stars at d-vertices, d≤5, in normal plane maps. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2013)

Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2013)

Describing 3-faces in normal plane maps with minimum degree 4. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2013)

Describing 3-paths in normal plane maps. - Oleg V. Borodin; Anna O. Ivanova; Tommy R. Jensen; Alexandr V. Kostochka; Matthew P. Yancey (Discret. Math., 2013)

Precise upper bound for the strong edge chromatic number of sparse planar graphs. - Oleg V. Borodin; Anna O. Ivanova (Discuss. Math. Graph Theory, 2013)

Acyclic 4-Choosability of Planar Graphs with No 4- and 5-Cycles. - Oleg V. Borodin; Anna O. Ivanova (J. Graph Theory, 2013)

Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11. - Oleg V. Borodin; Anna O. Ivanova; Alexandr V. Kostochka (Discret. Math., 2014)

Describing faces in plane triangulations. - Oleg V. Borodin; Anna O. Ivanova; Alexandr V. Kostochka (Discret. Math., 2014)

Light C4 and C5 in 3-polytopes with minimum degree 5. - Oleg V. Borodin; Anna O. Ivanova; Douglas R. Woodall (Discret. Math., 2014)

5-stars of low weight in normal plane maps with minimum degree 5. - Oleg V. Borodin; Anna O. Ivanova; Tommy R. Jensen (Discuss. Math. Graph Theory, 2014)

Weight of 3-Paths in Sparse Plane Graphs. - V. A. Aksenov; Oleg V. Borodin; Anna O. Ivanova (Electron. J. Comb., 2015)

Describing tight descriptions of 3-paths in triangle-free normal plane maps. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2015)

Low edges in 3-polytopes. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2015)

Every Triangulated 3-Polytope of Minimum Degree 4 has a 4-Path of Weight at Most 27. - Oleg V. Borodin; Anna O. Ivanova (Electron. J. Comb., 2016)

An analogue of Franklin's Theorem. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2016)

The weight of faces in normal plane maps. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2016)

Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2016)

Weight of edges in normal plane maps. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2016)

An extension of Kotzig's Theorem. - V. A. Aksenov; Oleg V. Borodin; Anna O. Ivanova (Discuss. Math. Graph Theory, 2016)

On the weight of minor faces in triangle-free polytopes. - Oleg V. Borodin; Anna O. Ivanova (Discuss. Math. Graph Theory, 2016)

Refined weight of edges in normal plane maps. - Tsyndyma Chimit-Dordjievna Batueva; Oleg V. Borodin; Mikhail A. Bykov; Anna O. Ivanova; Olesy N. Kazak; D. V. Nikiforov (Discret. Math., 2017)

Low 5-stars in normal plane maps with minimum degree 5. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2017)

On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2017)

Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices. - Oleg V. Borodin; Anna O. Ivanova; D. V. Nikiforov (Discret. Math., 2017)

All tight descriptions of 3-stars in 3-polytopes with girth 5. - Oleg V. Borodin; Anna O. Ivanova (Discuss. Math. Graph Theory, 2017)

All Tight Descriptions of 4-Paths in 3-Polytopes with Minimum Degree 5. - Tsyndyma Chimit-Dordjievna Batueva; Oleg V. Borodin; Anna O. Ivanova (Graphs Comb., 2017)

A Steinberg-Like Approach to Describing Faces in 3-Polytopes. - Oleg V. Borodin; Anna O. Ivanova; Ekaterina I. Vasil'eva (Graphs Comb., 2017)

Tight Descriptions of 3-Paths in Normal Plane Maps : Dedicated to Andre Raspaud on the occasion of his 70th birthday. - Oleg V. Borodin; Anna O. Ivanova; Alexandr V. Kostochka (J. Graph Theory, 2017)

Low minor faces in 3-polytopes. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2018)

All one-term tight descriptions of 3-paths in normal plane maps without K4-e. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2018)

Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7. - Oleg V. Borodin; Anna O. Ivanova; Olesy N. Kazak; Ekaterina I. Vasil'eva (Discret. Math., 2018)

More about the height of faces in 3-polytopes. - Oleg V. Borodin; Mikhail A. Bykov; Anna O. Ivanova (Discuss. Math. Graph Theory, 2018)

Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11. - Oleg V. Borodin; Anna O. Ivanova; Olesy N. Kazak (Discuss. Math. Graph Theory, 2018)

An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2019)

Describing faces in 3-polytopes with no vertices of degree from 5 to 7. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2019)

Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8. - Oleg V. Borodin; Anna O. Ivanova; Olesy N. Kazak (Discret. Math., 2019)

Low 5-stars at 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 7 to 9. - Oleg V. Borodin; Mikhail A. Bykov; Anna O. Ivanova (Discuss. Math. Graph Theory, 2020)

Light minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices. - Oleg V. Borodin; Anna O. Ivanova; Ekaterina I. Vasil'eva (Discuss. Math. Graph Theory, 2020)

All tight descriptions of 3-paths in plane graphs with girth at least 7. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2021)

Almost all about light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2022)

3-Vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2022)

Another tight description of faces in plane triangulations with minimum degree 4. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2022)

Tight description of faces of triangulations on the torus. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2023)

All tight descriptions of faces in plane triangulations with minimum degree 4. - Anna O. Ivanova; Oleg V. Borodin (Discuss. Math. Graph Theory, 2024)

Light 3-faces in 3-polytopes without adjacent triangles. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2025)

Tight description of faces in toroidal graphs with minimum degree at least 4. - Oleg V. Borodin; Anna O. Ivanova (Discuss. Math. Graph Theory, 2025)