According to our database
1,
Oleg V. Borodin
authored at least 112 papers
between 1977 and 2023.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2023
Tight description of faces of triangulations on the torus.
Discret. Math., September, 2023
2022
Another tight description of faces in plane triangulations with minimum degree 4.
Discret. Math., 2022
3-Vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices.
Discret. Math., 2022
Almost all about light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5.
Discret. Math., 2022
2021
All tight descriptions of 3-paths in plane graphs with girth at least 7.
Discret. Math., 2021
2020
Light minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices.
Discuss. Math. Graph Theory, 2020
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, 2020
2019
Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8.
Discret. Math., 2019
Describing faces in 3-polytopes with no vertices of degree from 5 to 7.
Discret. Math., 2019
An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations.
Discret. Math., 2019
2018
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, 2018
More about the height of faces in 3-polytopes.
Discuss. Math. Graph Theory, 2018
Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7.
Discret. Math., 2018
All one-term tight descriptions of 3-paths in normal plane maps without K4-e.
Discret. Math., 2018
Low minor faces in 3-polytopes.
Discret. Math., 2018
2017
Tight Descriptions of 3-Paths in Normal Plane Maps : Dedicated to Andre Raspaud on the occasion of his 70th birthday.
J. Graph Theory, 2017
A Steinberg-Like Approach to Describing Faces in 3-Polytopes.
Graphs Comb., 2017
All Tight Descriptions of 4-Paths in 3-Polytopes with Minimum Degree 5.
Graphs Comb., 2017
All tight descriptions of 3-stars in 3-polytopes with girth 5.
Discuss. Math. Graph Theory, 2017
Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices.
Discret. Math., 2017
On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5.
Discret. Math., 2017
Low 5-stars in normal plane maps with minimum degree 5.
Discret. Math., 2017
Refined weight of edges in normal plane maps.
Discret. Math., 2017
2016
On the weight of minor faces in triangle-free polytopes.
Discuss. Math. Graph Theory, 2016
An extension of Kotzig's Theorem.
Discuss. Math. Graph Theory, 2016
Weight of edges in normal plane maps.
Discret. Math., 2016
Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices.
Discret. Math., 2016
The weight of faces in normal plane maps.
Discret. Math., 2016
An analogue of Franklin's Theorem.
Discret. Math., 2016
Every Triangulated 3-Polytope of Minimum Degree 4 has a 4-Path of Weight at Most 27.
Electron. J. Comb., 2016
2015
Low edges in 3-polytopes.
Discret. Math., 2015
Describing tight descriptions of 3-paths in triangle-free normal plane maps.
Discret. Math., 2015
Weight of 3-Paths in Sparse Plane Graphs.
Electron. J. Comb., 2015
2014
Defective 2-colorings of sparse graphs.
J. Comb. Theory, Ser. B, 2014
Short proofs of coloring theorems on planar graphs.
Eur. J. Comb., 2014
Planar 4-critical graphs with four triangles.
Eur. J. Comb., 2014
5-stars of low weight in normal plane maps with minimum degree 5.
Discuss. Math. Graph Theory, 2014
Light C<sub>4</sub> and C<sub>5</sub> in 3-polytopes with minimum degree 5.
Discret. Math., 2014
Describing faces in plane triangulations.
Discret. Math., 2014
Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11.
Discret. Math., 2014
2013
Acyclic 4-Choosability of Planar Graphs with No 4- and 5-Cycles.
J. Graph Theory, 2013
Precise upper bound for the strong edge chromatic number of sparse planar graphs.
Discuss. Math. Graph Theory, 2013
On 11-improper 22-coloring of sparse graphs.
Discret. Math., 2013
Describing 3-paths in normal plane maps.
Discret. Math., 2013
Describing 3-faces in normal plane maps with minimum degree 4.
Discret. Math., 2013
Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5.
Discret. Math., 2013
Describing (d-2)-stars at d-vertices, d≤5, in normal plane maps.
Discret. Math., 2013
Colorings of plane graphs: A survey.
Discret. Math., 2013
2012
A step towards the strong version of Havel's three color conjecture.
J. Comb. Theory, Ser. B, 2012
2-distance 4-colorability of planar subcubic graphs with girth at least 22.
Discuss. Math. Graph Theory, 2012
(k, 1)-coloring of sparse graphs.
Discret. Math., 2012
Acyclic 4-choosability of planar graphs without adjacent short cycles.
Discret. Math., 2012
List 2-facial 5-colorability of plane graphs with girth at least 12.
Discret. Math., 2012
2011
Acyclic 5-choosability of planar graphs without adjacent short cycles.
J. Graph Theory, 2011
List strong linear 2-arboricity of sparse graphs.
J. Graph Theory, 2011
Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable.
J. Graph Theory, 2011
List injective colorings of planar graphs.
Discret. Math., 2011
(k, j)-coloring of sparse graphs.
Discret. Appl. Math., 2011
2010
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most <i>k</i>.
J. Graph Theory, 2010
Planar graphs without adjacent cycles of length at most seven are 3-colorable.
Discret. Math., 2010
Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles.
Discret. Math., 2010
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable.
Discret. Math., 2010
Acyclic 3-choosability of sparse graphs with girth at least 7.
Discret. Math., 2010
2009
<i>M</i>-degrees of quadrangle-free planar graphs.
J. Graph Theory, 2009
Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable.
J. Graph Theory, 2009
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable.
J. Comb. Theory, Ser. B, 2009
List 2-distance (Delta+2)-coloring of planar graphs with girth six.
Eur. J. Comb., 2009
Decompositions of quadrangle-free planar graphs.
Discuss. Math. Graph Theory, 2009
Planar graphs decomposable into a forest and a matching.
Discret. Math., 2009
2-distance (Delta+2)-coloring of planar graphs with girth six and Delta>=18.
Discret. Math., 2009
2008
Decomposing a planar graph with girth 9 into a forest and a matching.
Eur. J. Comb., 2008
2007
A new upper bound on the cyclic chromatic number.
J. Graph Theory, 2007
2005
Planar graphs without cycles of length from 4 to 7 are 3-colorable.
J. Comb. Theory, Ser. B, 2005
Deeply asymmetric planar graphs.
J. Comb. Theory, Ser. B, 2005
2004
Homomorphisms from sparse graphs with large girth.
J. Comb. Theory, Ser. B, 2004
Height of minor faces in plane normal maps.
Discret. Appl. Math., 2004
Preface: Russian Translations II.
Discret. Appl. Math., 2004
2003
A sufficient condition for planar graphs to be 3-colorable.
J. Comb. Theory, Ser. B, 2003
2002
Cyclic Colorings of 3-Polytopes with Large Maximum Face Size.
SIAM J. Discret. Math., 2002
Acyclic list 7-coloring of planar graphs.
J. Graph Theory, 2002
2001
On Deeply Critical Oriented Graphs.
J. Comb. Theory, Ser. B, 2001
Acyclic colouring of 1-planar graphs.
Discret. Appl. Math., 2001
Discret. Appl. Math., 2001
2000
Variable degeneracy: extensions of Brooks' and Gallai's theorems.
Discret. Math., 2000
1999
Cyclic Degrees of 3-Polytopes.
Graphs Comb., 1999
On cyclic colorings and their generalizations.
Discret. Math., 1999
On the maximum average degree and the oriented chromatic number of a graph.
Discret. Math., 1999
1998
Total Colourings of Planar Graphs with Large Girth.
Eur. J. Comb., 1998
Short cycles of low weight in normal plane maps with minimum degree 5.
Discuss. Math. Graph Theory, 1998
On kernel-perfect orientations of line graphs.
Discret. Math., 1998
On universal graphs for planar oriented graphs of a given girth.
Discret. Math., 1998
Triangulated 3-polytopes without faces of low weight.
Discret. Math., 1998
1997
Total colorings of planar graphs with large maximum degree.
J. Graph Theory, 1997
List Edge and List Total Colourings of Multigraphs.
J. Comb. Theory, Ser. B, 1997
Minimal vertex degree sum of a 3-path in plane maps.
Discuss. Math. Graph Theory, 1997
A new proof of Grünbaum's 3 color theorem.
Discret. Math., 1997
1996
Structural properties of plane graphs without adjacent triangles and an application to 3-colorings.
J. Graph Theory, 1996
Structural theorem on plane graphs with application to the entire coloring number.
J. Graph Theory, 1996
Cyclic degree and cyclic coloring of 3-polytopes.
J. Graph Theory, 1996
Irreducible graphs in the Grünbaum-Havel 3-colour problem.
Discret. Math., 1996
To the paper of H.L. Abbott and B. Zhou on 4-critical planar graphs.
Ars Comb., 1996
1995
A new proof of the 6 color theorem.
J. Graph Theory, 1995
Triangles with restricted degree sum of their boundary vertices in plane graphs.
Discret. Math., 1995
1994
Simultaneous coloring of edges and faces of plane graphs.
Discret. Math., 1994
1993
Joint extension of two theorems of Kotzig on 3-polytopes.
Comb., 1993
1992
Decomposition of K<sub>13</sub> into a torus graph and a graph imbedded in the Klein bottle.
Discret. Math., 1992
Diagonal coloring of the vertices of triangulations.
Discret. Math., 1992
Cyclic coloring of plane graphs.
Discret. Math., 1992
1991
Four problems on plane graphs raised by Branko Grünbaum.
Proceedings of the Graph Structure Theory, 1991
1990
Diagonal 11-coloring of plane triangulations.
J. Graph Theory, 1990
1979
On acyclic colorings of planar graphs.
Discret. Math., 1979
1977
On an upper bound of a graph's chromatic number, depending on the graph's degree and density.
J. Comb. Theory, Ser. B, 1977
