Anna O. Ivanova

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