Anna O. Ivanova

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 31

Top Topics

Normal Direction

Top Venues

Discuss. Math. Graph Theory

Electron. J. Comb.

Publications

Anna O. Ivanova, Oleg V. Borodin
All tight descriptions of faces in plane triangulations with minimum degree 4. Discuss. Math. Graph Theory 44 (3) (2024)
Oleg V. Borodin, Anna O. Ivanova
Tight description of faces of triangulations on the torus. Discret. Math. 346 (9) (2023)
Oleg V. Borodin, Anna O. Ivanova
Another tight description of faces in plane triangulations with minimum degree 4. Discret. Math. 345 (9) (2022)
Oleg V. Borodin, Anna O. Ivanova
3-Vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices. Discret. Math. 345 (8) (2022)
Oleg V. Borodin, Anna O. Ivanova
Almost all about light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5. Discret. Math. 345 (2) (2022)
Oleg V. Borodin, Anna O. Ivanova
All tight descriptions of 3-paths in plane graphs with girth at least 7. Discret. Math. 344 (5) (2021)
Oleg V. Borodin, Anna O. Ivanova, Ekaterina I. Vasil'eva
Light minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices. Discuss. Math. Graph Theory 40 (4) (2020)
Oleg V. Borodin, Mikhail A. Bykov, Anna O. Ivanova
Low 5-stars at 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 7 to 9. Discuss. Math. Graph Theory 40 (4) (2020)
Oleg V. Borodin, Anna O. Ivanova, Olesy N. Kazak
Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8. Discret. Math. 342 (8) (2019)
Oleg V. Borodin, Anna O. Ivanova
Describing faces in 3-polytopes with no vertices of degree from 5 to 7. Discret. Math. 342 (11) (2019)
Oleg V. Borodin, Anna O. Ivanova
An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations. Discret. Math. 342 (6) (2019)
Oleg V. Borodin, Anna O. Ivanova, Olesy N. Kazak
Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11. Discuss. Math. Graph Theory 38 (3) (2018)
Oleg V. Borodin, Anna O. Ivanova
All one-term tight descriptions of 3-paths in normal plane maps without K4-e. Discret. Math. 341 (12) (2018)
Oleg V. Borodin, Anna O. Ivanova, Olesy N. Kazak, Ekaterina I. Vasil'eva
Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7. Discret. Math. 341 (3) (2018)
Oleg V. Borodin, Mikhail A. Bykov, Anna O. Ivanova
More about the height of faces in 3-polytopes. Discuss. Math. Graph Theory 38 (2) (2018)
Oleg V. Borodin, Anna O. Ivanova
Low minor faces in 3-polytopes. Discret. Math. 341 (12) (2018)
Oleg V. Borodin, Anna O. Ivanova, Ekaterina I. Vasil'eva
A Steinberg-Like Approach to Describing Faces in 3-Polytopes. Graphs Comb. 33 (1) (2017)
Tsyndyma Chimit-Dordjievna Batueva, Oleg V. Borodin, Mikhail A. Bykov, Anna O. Ivanova, Olesy N. Kazak, D. V. Nikiforov
Refined weight of edges in normal plane maps. Discret. Math. 340 (11) (2017)
Oleg V. Borodin, Anna O. Ivanova
On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5. Discret. Math. 340 (9) (2017)
Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka
Tight Descriptions of 3-Paths in Normal Plane Maps : Dedicated to Andre Raspaud on the occasion of his 70th birthday. J. Graph Theory 85 (1) (2017)
Oleg V. Borodin, Anna O. Ivanova, D. V. Nikiforov
Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices. Discret. Math. 340 (7) (2017)
Oleg V. Borodin, Anna O. Ivanova
All tight descriptions of 3-stars in 3-polytopes with girth 5. Discuss. Math. Graph Theory 37 (1) (2017)
Tsyndyma Chimit-Dordjievna Batueva, Oleg V. Borodin, Anna O. Ivanova
All Tight Descriptions of 4-Paths in 3-Polytopes with Minimum Degree 5. Graphs Comb. 33 (1) (2017)
Oleg V. Borodin, Anna O. Ivanova
Low 5-stars in normal plane maps with minimum degree 5. Discret. Math. 340 (2) (2017)
Oleg V. Borodin, Anna O. Ivanova
An analogue of Franklin's Theorem. Discret. Math. 339 (10) (2016)
Oleg V. Borodin, Anna O. Ivanova
On the weight of minor faces in triangle-free polytopes. Discuss. Math. Graph Theory 36 (3) (2016)
Oleg V. Borodin, Anna O. Ivanova
Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices. Discret. Math. 339 (2) (2016)
V. A. Aksenov, Oleg V. Borodin, Anna O. Ivanova
An extension of Kotzig's Theorem. Discuss. Math. Graph Theory 36 (4) (2016)
Oleg V. Borodin, Anna O. Ivanova
The weight of faces in normal plane maps. Discret. Math. 339 (10) (2016)
Oleg V. Borodin, Anna O. Ivanova
Weight of edges in normal plane maps. Discret. Math. 339 (5) (2016)
Oleg V. Borodin, Anna O. Ivanova
Every Triangulated 3-Polytope of Minimum Degree 4 has a 4-Path of Weight at Most 27. Electron. J. Comb. 23 (3) (2016)
V. A. Aksenov, Oleg V. Borodin, Anna O. Ivanova
Weight of 3-Paths in Sparse Plane Graphs. Electron. J. Comb. 22 (3) (2015)
Oleg V. Borodin, Anna O. Ivanova
Describing tight descriptions of 3-paths in triangle-free normal plane maps. Discret. Math. 338 (11) (2015)
Oleg V. Borodin, Anna O. Ivanova
Low edges in 3-polytopes. Discret. Math. 338 (12) (2015)
Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka
Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11. Discret. Math. (2014)
Oleg V. Borodin, Anna O. Ivanova, Tommy R. Jensen
5-stars of low weight in normal plane maps with minimum degree 5. Discuss. Math. Graph Theory 34 (3) (2014)
Oleg V. Borodin, Anna O. Ivanova, Douglas R. Woodall
in 3-polytopes with minimum degree 5. Discret. Math. 334 (2014)
Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka
Describing faces in plane triangulations. Discret. Math. 319 (2014)
Oleg V. Borodin, Anna O. Ivanova
Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5. Discret. Math. 313 (17) (2013)
Oleg V. Borodin, Anna O. Ivanova, Tommy R. Jensen, Alexandr V. Kostochka, Matthew P. Yancey
Describing 3-paths in normal plane maps. Discret. Math. 313 (23) (2013)
Oleg V. Borodin, Anna O. Ivanova
Describing (d-2)-stars at d-vertices, d≤5, in normal plane maps. Discret. Math. 313 (17) (2013)
Oleg V. Borodin, Anna O. Ivanova
Describing 3-faces in normal plane maps with minimum degree 4. Discret. Math. 313 (23) (2013)
Oleg V. Borodin, Anna O. Ivanova
Acyclic 4-Choosability of Planar Graphs with No 4- and 5-Cycles. J. Graph Theory 72 (4) (2013)
Oleg V. Borodin, Anna O. Ivanova
Precise upper bound for the strong edge chromatic number of sparse planar graphs. Discuss. Math. Graph Theory 33 (4) (2013)
Oleg V. Borodin, Anna O. Ivanova
Acyclic 4-choosability of planar graphs without adjacent short cycles. Discret. Math. 312 (22) (2012)
Oleg V. Borodin, Anna O. Ivanova
List 2-facial 5-colorability of plane graphs with girth at least 12. Discret. Math. 312 (2) (2012)
Oleg V. Borodin, Anna O. Ivanova
2-distance 4-colorability of planar subcubic graphs with girth at least 22. Discuss. Math. Graph Theory 32 (1) (2012)
Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud
(k, 1)-coloring of sparse graphs. Discret. Math. 312 (6) (2012)
Oleg V. Borodin, Anna O. Ivanova
List strong linear 2-arboricity of sparse graphs. J. Graph Theory 67 (2) (2011)
Oleg V. Borodin, Anna O. Ivanova
Acyclic 5-choosability of planar graphs without adjacent short cycles. J. Graph Theory 68 (2) (2011)
Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud
(k, j)-coloring of sparse graphs. Discret. Appl. Math. 159 (17) (2011)
Oleg V. Borodin, Anna O. Ivanova
List injective colorings of planar graphs. Discret. Math. 311 (2-3) (2011)
Oleg V. Borodin, Anna O. Ivanova, André Raspaud
Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles. Discret. Math. 310 (21) (2010)
Oleg V. Borodin, Min Chen, Anna O. Ivanova, André Raspaud
Acyclic 3-choosability of sparse graphs with girth at least 7. Discret. Math. 310 (17-18) (2010)
Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, Pascal Ochem, André Raspaud
. J. Graph Theory 65 (2) (2010)
Oleg V. Borodin, Anna O. Ivanova
2-distance (Delta+2)-coloring of planar graphs with girth six and Delta>=18. Discret. Math. 309 (23-24) (2009)
Oleg V. Borodin, Anna O. Ivanova
Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable. J. Graph Theory 62 (3) (2009)
Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka, Naeem N. Sheikh
Decompositions of quadrangle-free planar graphs. Discuss. Math. Graph Theory 29 (1) (2009)
Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka, Naeem N. Sheikh
Planar graphs decomposable into a forest and a matching. Discret. Math. 309 (1) (2009)
Oleg V. Borodin, Anna O. Ivanova
List 2-distance (Delta+2)-coloring of planar graphs with girth six. Eur. J. Comb. 30 (5) (2009)