Anna O. Ivanova

发表

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, 2018, Discret. Math..

Acyclic 4-Choosability of Planar Graphs with No 4- and 5-Cycles

Oleg V. Borodin, Anna O. Ivanova, 2013, J. Graph Theory.

List injective colorings of planar graphs

Oleg V. Borodin, Anna O. Ivanova, 2011, Discret. Math..

Tight Descriptions of 3-Paths in Normal Plane Maps : Dedicated to Andre Raspaud on the occasion of his 70th birthday

Alexandr V. Kostochka, Oleg V. Borodin, Anna O. Ivanova, 2017, J. Graph Theory.

Weight of 3-Paths in Sparse Plane Graphs

Oleg V. Borodin, Anna O. Ivanova, V. A. Aksenov, 2015, Electron. J. Comb..

List 2-distance (Delta+2)-coloring of planar graphs with girth six

Oleg V. Borodin, Anna O. Ivanova, 2009, Eur. J. Comb..

Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles

André Raspaud, Oleg V. Borodin, Anna O. Ivanova, 2010, Discret. Math..

Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices

Oleg V. Borodin, Anna O. Ivanova, D. V. Nikiforov, 2017, Discret. Math..

On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5

Oleg V. Borodin, Anna O. Ivanova, 2017, Discret. Math..

2-distance (Delta+2)-coloring of planar graphs with girth six and Delta>=18

Oleg V. Borodin, Anna O. Ivanova, 2009, Discret. Math..

Decompositions of quadrangle-free planar graphs

Alexandr V. Kostochka, Oleg V. Borodin, Anna O. Ivanova, 2009, Discuss. Math. Graph Theory.

Describing faces in plane triangulations

Alexandr V. Kostochka, Oleg V. Borodin, Anna O. Ivanova, 2014, Discret. Math..

Low 5-Stars at 5-Vertices in 3-Polytopes with Minimum Degree 5 and No Vertices of Degree from 7 to 9

Mikhail A. Bykov, Oleg V. Borodin, Anna O. Ivanova, 2020, Discuss. Math. Graph Theory.

All Tight Descriptions of 4-Paths in 3-Polytopes with Minimum Degree 5

Oleg V. Borodin, Anna O. Ivanova, Ts. Ch.-D. Batueva, 2017, Graphs Comb..

The weight of faces in normal plane maps

Oleg V. Borodin, Anna O. Ivanova, 2016, Discret. Math..

A Steinberg-Like Approach to Describing Faces in 3-Polytopes

Oleg V. Borodin, Anna O. Ivanova, E. I. Vasil'eva, 2017, Graphs Comb..

Low 5-stars in normal plane maps with minimum degree 5

Oleg V. Borodin, Anna O. Ivanova, 2017, Discret. Math..

An Extension of Kotzig’s Theorem

Oleg V. Borodin, Anna O. Ivanova, V. A. Aksenov, 2016, Discuss. Math. Graph Theory.

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, 2018, Discuss. Math. Graph Theory.

An analogue of Franklin's Theorem

Oleg V. Borodin, Anna O. Ivanova, 2016, Discret. Math..

Describing 3-paths in normal plane maps

Alexandr V. Kostochka, Tommy R. Jensen, Matthew P. Yancey, 2013, Discret. Math..

Refined weight of edges in normal plane maps

Mikhail A. Bykov, Oleg V. Borodin, Anna O. Ivanova, 2017, Discret. Math..

List 2-facial 5-colorability of plane graphs with girth at least 12

Oleg V. Borodin, Anna O. Ivanova, 2012, Discret. Math..

On the Weight of Minor Faces in Triangle-Free 3-Polytopes

Oleg V. Borodin, Anna O. Ivanova, 2016, Discuss. Math. Graph Theory.

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, 2019, Discret. Math..

All one-term tight descriptions of 3-paths in normal plane maps without K4-e

Oleg V. Borodin, Anna O. Ivanova, 2018, Discret. Math..

(k, J)-coloring of Sparse Graphs

André Raspaud, Mickaël Montassier, Oleg V. Borodin, 2011, Discret. Appl. Math..

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, 2020, Discuss. Math. Graph Theory.

Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11

Alexandr V. Kostochka, Oleg V. Borodin, Anna O. Ivanova, 2014, Discret. Math..

Every Triangulated 3-Polytope of Minimum Degree 4 has a 4-Path of Weight at Most 27

Oleg V. Borodin, Anna O. Ivanova, 2016, Electron. J. Comb..

Describing tight descriptions of 3-paths in triangle-free normal plane maps

Oleg V. Borodin, Anna O. Ivanova, 2015, Discret. Math..

Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5

Oleg V. Borodin, Anna O. Ivanova, 2013, Discret. Math..

Acyclic 3-choosability of sparse graphs with girth at least 7

Min Chen, André Raspaud, Oleg V. Borodin, 2010, Discret. Math..

More About the Height of Faces in 3-Polytopes

Mikhail A. Bykov, Oleg V. Borodin, Anna O. Ivanova, 2018, Discuss. Math. Graph Theory.

Describing 3-faces in normal plane maps with minimum degree 4

Oleg V. Borodin, Anna O. Ivanova, 2013, Discret. Math..

Weight of edges in normal plane maps

Oleg V. Borodin, Anna O. Ivanova, 2016, Discret. Math..

Acyclic 4-choosability of planar graphs without adjacent short cycles

Oleg V. Borodin, Anna O. Ivanova, 2012, Discret. Math..

Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k

André Raspaud, Mickaël Montassier, Pascal Ochem, 2010, J. Graph Theory.

5-Stars of Low Weight in Normal Plane Maps with Minimum Degree 5

Tommy R. Jensen, Oleg V. Borodin, Anna O. Ivanova, 2014, Discuss. Math. Graph Theory.

(k, 1)-coloring of Sparse Graphs

André Raspaud, Mickaël Montassier, Oleg V. Borodin, 2012, Discret. Math..

An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations

Oleg V. Borodin, Anna O. Ivanova, 2019, Discret. Math..

2-distance 4-colorability of Planar Subcubic Graphs with Girth at Least 22

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2012, Discuss. Math. Graph Theory.

Low minor faces in 3-polytopes

Oleg V. Borodin, Anna O. Ivanova, 2018, Discret. Math..

Precise Upper Bound for the Strong Edge Chromatic Number of Sparse Planar Graphs

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2013, Discuss. Math. Graph Theory.

Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable

Oleg V. Borodin, Anna O. Ivanova, 2009, J. Graph Theory.

Planar graphs decomposable into a forest and a matching

Alexandr V. Kostochka, Oleg V. Borodin, Anna O. Ivanova, 2009, Discret. Math..

List strong linear 2‐arboricity of sparse graphs

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2011, J. Graph Theory.

All Tight Descriptions of 3-Stars in 3-Polytopes with Girth 5

Oleg V. Borodin, Anna O. Ivanova, 2017, Discuss. Math. Graph Theory.

Light C4 and C5 in 3-polytopes with minimum degree 5

Douglas R. Woodall, Oleg V. Borodin, Anna O. Ivanova, 2014, Discret. Math..

Low edges in 3-polytopes

Oleg V. Borodin, Anna O. Ivanova, 2015, Discret. Math..

Describing (d-2)-stars at d-vertices, d≤5, in normal plane maps

Oleg V. Borodin, Anna O. Ivanova, 2013, Discret. Math..

Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices

Oleg V. Borodin, Anna O. Ivanova, 2016, Discret. Math..

All tight descriptions of 3-paths in plane graphs with girth at least 7

Oleg V. Borodin, Anna O. Ivanova, 2021, Discret. Math..

( 5 , 2 )-Coloring of Sparse Graphs

Alexandr V. Kostochka, Stephen G. Hartke, Douglas B. West, 2007 .

Low and light 5-stars in 3-polytopes with minimum degree 5 and restrictions on the degrees of major vertices

Oleg V. Borodin, Anna O. Ivanova, D. V. Nikiforov, 2017 .

List 2-distance (Δ + 1)-coloring of planar graphs with given girth

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2008 .

2-distance coloring of sparse planar graphs.

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2004 .

MINIMAX DEGREES OF QUASIPLANAR GRAPHS WITH NO SHORT CYCLES OTHER THAN TRIANGLES

Alexandr V. Kostochka, Oleg V. Borodin, Anna O. Ivanova, 2008 .

Near-proper vertex 2-colorings of sparse graphs

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2010 .

Oriented 5-coloring of sparse plane graphs

Alexandr V. Kostochka, Oleg V. Borodin, Anna O. Ivanova, 2007 .

New results about the structure of plane graphs: A survey

Oleg V. Borodin, Anna O. Ivanova, 2017 .

Circuit decompositions of join-covered graphs

Oleg V. Borodin, Anna O. Ivanova, C. Little, 2009 .

Injective (Δ + 1)-coloring of planar graphs with girth 6

Oleg V. Borodin, Anna O. Ivanova, 2011 .

2-Distance 4-coloring of planar subcubic graphs

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2011 .

The vertex-face weight of edges in 3-polytopes

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2015 .

Acyclic 5-choosability of planar graphs without 4-cycles

Oleg V. Borodin, Anna O. Ivanova, 2011 .

Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k

André Raspaud, Mickaël Montassier, Pascal Ochem, 2010 .

CIRCULAR (5;2)-COLORING OF SPARSE GRAPHS

Alexandr V. Kostochka, Douglas B. West, Oleg V. Borodin, 2008 .

List 2-distance (Δ + 2)-coloring of planar graphs with girth 6 and Δ ≥ 24

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2009 .

Light and low 5-stars in normal plane maps with minimum degree 5

Oleg V. Borodin, Anna O. Ivanova, 2016 .

Sufficient conditions for planar graphs to be 2-distance ()-colourable.

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2004 .

Acyclic 5-choosability of planar graphs without adjacent short cycles

Oleg V. Borodin, Anna O. Ivanova, 2011, J. Graph Theory.

Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6.

Oleg V. Borodin, Anna O. Ivanova, T. K. Neustroeva, 2006 .

List 2-distance (Δ + 1)-coloring of planar graphs with girth at least 7

Anna O. Ivanova, A. Ivanova, 2011 .