Oleg V. Borodin
According to our database1,
Oleg V. Borodin
authored at least 115 papers
between 1977 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
1980
1985
1990
1995
2000
2005
2010
2015
2020
2025
0
1
2
3
4
5
6
7
8
9
2
1
1
3
1
2
3
5
8
7
3
7
8
5
5
5
7
1
1
1
2
3
1
2
3
1
3
5
4
5
2
1
1
3
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Discuss. Math. Graph Theory, 2025
2024
Discuss. Math. Graph Theory, 2024
2023
Discret. Math., September, 2023
2022
Discret. Math., 2022
Discret. Math., 2022
Almost all about light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5.
Discret. Math., 2022
2021
Discret. Math., 2021
2020
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
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
Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7.
Discret. Math., 2018
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
Graphs Comb., 2017
Discuss. Math. Graph Theory, 2017
Discret. Math., 2017
Discret. Math., 2017
2016
Discuss. Math. Graph Theory, 2016
Discret. Math., 2016
Electron. J. Comb., 2016
2015
Discret. Math., 2015
2014
Discuss. Math. Graph Theory, 2014
Discret. Math., 2014
Discret. Math., 2014
2013
J. Graph Theory, 2013
Discuss. Math. Graph Theory, 2013
Discret. Math., 2013
Discret. Math., 2013
2012
J. Comb. Theory B, 2012
Discuss. Math. Graph Theory, 2012
Discret. Math., 2012
Discret. Math., 2012
2011
J. Graph Theory, 2011
J. Graph Theory, 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
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
2009
J. Graph Theory, 2009
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable.
J. Comb. Theory B, 2009
Eur. J. Comb., 2009
Discret. Math., 2009
2008
Eur. J. Comb., 2008
2007
2006
2005
J. Comb. Theory B, 2005
2004
2003
2002
SIAM J. Discret. Math., 2002
2001
2000
Discret. Math., 2000
1999
Discret. Math., 1999
1998
Discuss. Math. Graph Theory, 1998
Discret. Math., 1998
1997
Discuss. Math. Graph Theory, 1997
1996
Structural properties of plane graphs without adjacent triangles and an application to 3-colorings.
J. Graph Theory, 1996
J. Graph Theory, 1996
To the paper of H.L. Abbott and B. Zhou on 4-critical planar graphs.
Ars Comb., 1996
1995
Discret. Math., 1995
1994
1993
1992
Decomposition of K<sub>13</sub> into a torus graph and a graph imbedded in the Klein bottle.
Discret. Math., 1992
1991
Four problems on plane graphs raised by Branko Grünbaum.
Proceedings of the Graph Structure Theory, 1991
1990
1977
On an upper bound of a graph's chromatic number, depending on the graph's degree and density.
J. Comb. Theory B, 1977