Oleg V. Borodin

117 papers Journal 116Unranked 1
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
Defective 2-colorings of sparse graphs.
J. Comb. Theory B
Oleg V. Borodin, Alexandr V. Kostochka
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
2014 J jnl
Planar 4-critical graphs with four triangles.
Eur. J. Comb.
Oleg V. Borodin, Zdenek Dvorák, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
2014 J jnl
Short proofs of coloring theorems on planar graphs.
Eur. J. Comb.
Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
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
Colorings of plane graphs: A survey.
Discret. Math.
Oleg V. Borodin
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
On 11-improper 22-coloring of sparse graphs.
Discret. Math.
Oleg V. Borodin, Alexandr V. Kostochka, Matthew P. Yancey
2013 J jnl
Planar 4-critical graphs with four triangles.
CoRR
Oleg V. Borodin, Zdenek Dvorák, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
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
A step towards the strong version of Havel's three color conjecture.
J. Comb. Theory B
Oleg V. Borodin, Alexei N. Glebov, Tommy R. Jensen
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
2012 J jnl
Short proofs of coloring theorems on planar graphs
CoRR
Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
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
2011 J jnl
Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable.
J. Graph Theory
Oleg V. Borodin, Alexei N. Glebov
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
Planar graphs without adjacent cycles of length at most seven are 3-colorable.
Discret. Math.
Oleg V. Borodin, Mickaël Montassier, André Raspaud
2010 J jnl
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable.
Discret. Math.
Oleg V. Borodin, Alexei N. Glebov, 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
2009 J jnl
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable.
J. Comb. Theory B
Oleg V. Borodin, Alexei N. Glebov, Mickaël Montassier, André Raspaud
2008 J jnl
Decomposing a planar graph with girth 9 into a forest and a matching.
Eur. J. Comb.
Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu
2007 J jnl
A new upper bound on the cyclic chromatic number.
J. Graph Theory
Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, Jan van den Heuvel
2006 J jnl
On acyclic colorings of planar graphs.
Discret. Math.
Oleg V. Borodin
2005 J jnl
Deeply asymmetric planar graphs.
J. Comb. Theory B
V. A. Aksionov, Oleg V. Borodin, Leonid S. Melnikov, Gert Sabidussi, Michael Stiebitz, Bjarne Toft
2005 J jnl
Planar graphs without cycles of length from 4 to 7 are 3-colorable.
J. Comb. Theory B
Oleg V. Borodin, Alexei N. Glebov, André Raspaud, Mohammad R. Salavatipour
2004 J jnl
Height of minor faces in plane normal maps.
Discret. Appl. Math.
Oleg V. Borodin, D. V. Loparev
2004 J jnl
Homomorphisms from sparse graphs with large girth.
J. Comb. Theory B
Oleg V. Borodin, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West
2004 J jnl
Preface: Russian Translations II.
Discret. Appl. Math.
Oleg V. Borodin
2003 J jnl
A sufficient condition for planar graphs to be 3-colorable.
J. Comb. Theory B
Oleg V. Borodin, André Raspaud
2002 J jnl
Acyclic list 7-coloring of planar graphs.
J. Graph Theory
Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena
2002 J jnl
Cyclic Colorings of 3-Polytopes with Large Maximum Face Size.
SIAM J. Discret. Math.
Oleg V. Borodin, Douglas R. Woodall
2001 J jnl
Acyclic colouring of 1-planar graphs.
Discret. Appl. Math.
Oleg V. Borodin, Alexandr V. Kostochka, André Raspaud, Éric Sopena
2001 J jnl
On Deeply Critical Oriented Graphs.
J. Comb. Theory B
Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena
2001 J jnl
Preface.
Discret. Appl. Math.
Oleg V. Borodin
2000 J jnl
Variable degeneracy: extensions of Brooks' and Gallai's theorems.
Discret. Math.
Oleg V. Borodin, Alexandr V. Kostochka, Bjarne Toft
1999 J jnl
Cyclic Degrees of 3-Polytopes.
Graphs Comb.
Oleg V. Borodin, Douglas R. Woodall
1999 J jnl
On cyclic colorings and their generalizations.
Discret. Math.
Oleg V. Borodin, Daniel P. Sanders, Yue Zhao
1999 J jnl
On the maximum average degree and the oriented chromatic number of a graph.
Discret. Math.
Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena
1998 J jnl
On kernel-perfect orientations of line graphs.
Discret. Math.
Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
1998 J jnl
On universal graphs for planar oriented graphs of a given girth.
Discret. Math.
Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena
1998 J jnl
Short cycles of low weight in normal plane maps with minimum degree 5.
Discuss. Math. Graph Theory
Oleg V. Borodin, Douglas R. Woodall
1998 J jnl
Total Colourings of Planar Graphs with Large Girth.
Eur. J. Comb.
Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
1998 J jnl
Triangulated 3-polytopes without faces of low weight.
Discret. Math.
Oleg V. Borodin
1997 J jnl
A new proof of Grünbaum's 3 color theorem.
Discret. Math.
Oleg V. Borodin
1997 J jnl
List Edge and List Total Colourings of Multigraphs.
J. Comb. Theory B
Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
1997 J jnl
Minimal vertex degree sum of a 3-path in plane maps.
Discuss. Math. Graph Theory
Oleg V. Borodin
1997 J jnl
Total colorings of planar graphs with large maximum degree.
J. Graph Theory
Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
1996 J jnl
Cyclic degree and cyclic coloring of 3-polytopes.
J. Graph Theory
Oleg V. Borodin
1996 J jnl
Irreducible graphs in the Grünbaum-Havel 3-colour problem.
Discret. Math.
Oleg V. Borodin
1996 J jnl
Structural properties of plane graphs without adjacent triangles and an application to 3-colorings.
J. Graph Theory
Oleg V. Borodin
1996 J jnl
Structural theorem on plane graphs with application to the entire coloring number.
J. Graph Theory
Oleg V. Borodin
1996 J jnl
To the paper of H.L. Abbott and B. Zhou on 4-critical planar graphs.
Ars Comb.
Oleg V. Borodin
1995 J jnl
A new proof of the 6 color theorem.
J. Graph Theory
Oleg V. Borodin
1995 J jnl
Triangles with restricted degree sum of their boundary vertices in plane graphs.
Discret. Math.
Oleg V. Borodin
1994 J jnl
Simultaneous coloring of edges and faces of plane graphs.
Discret. Math.
Oleg V. Borodin
1993 J jnl
Joint extension of two theorems of Kotzig on 3-polytopes.
Comb.
Oleg V. Borodin
1992 J jnl
Cyclic coloring of plane graphs.
Discret. Math.
Oleg V. Borodin
1992 J jnl
Decomposition of K
Discret. Math.
Oleg V. Borodin, Jean Mayer
1992 J jnl
Diagonal coloring of the vertices of triangulations.
Discret. Math.
Oleg V. Borodin
1991 — conf
Four problems on plane graphs raised by Branko Grünbaum.
Graph Structure Theory
Oleg V. Borodin
1990 J jnl
Diagonal 11-coloring of plane triangulations.
J. Graph Theory
Oleg V. Borodin
1979 J jnl
On acyclic colorings of planar graphs.
Discret. Math.
Oleg V. Borodin
1977 J jnl
On an upper bound of a graph's chromatic number, depending on the graph's degree and density.
J. Comb. Theory B
Oleg V. Borodin, Alexandr V. Kostochka