O. V. Borodin

4.0k total citations
148 papers, 2.6k citations indexed

About

O. V. Borodin is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Electrical and Electronic Engineering. According to data from OpenAlex, O. V. Borodin has authored 148 papers receiving a total of 2.6k indexed citations (citations by other indexed papers that have themselves been cited), including 127 papers in Computational Theory and Mathematics, 61 papers in Computer Graphics and Computer-Aided Design and 51 papers in Electrical and Electronic Engineering. Recurrent topics in O. V. Borodin's work include Advanced Graph Theory Research (122 papers), Computational Geometry and Mesh Generation (61 papers) and Graph Labeling and Dimension Problems (59 papers). O. V. Borodin is often cited by papers focused on Advanced Graph Theory Research (122 papers), Computational Geometry and Mesh Generation (61 papers) and Graph Labeling and Dimension Problems (59 papers). O. V. Borodin collaborates with scholars based in Russia, United States and France. O. V. Borodin's co-authors include A. O. Ivanova, Alexandr Kostochka, Douglas R. Woodall, André Raspaud, A. N. Glebov, Éric Sopena, Mohammad R. Salavatipour, Daniel P. Sanders, Mickaël Montassier and Jan van den Heuvel and has published in prestigious journals such as Discrete Applied Mathematics, Discrete Mathematics and Journal of the London Mathematical Society.

In The Last Decade

O. V. Borodin

141 papers receiving 2.5k citations

Peers

Countries citing papers authored by O. V. Borodin

Since Specialization

Citations

This map shows the geographic impact of O. V. Borodin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by O. V. Borodin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites O. V. Borodin more than expected).

Fields of papers citing papers by O. V. Borodin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by O. V. Borodin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by O. V. Borodin. The network helps show where O. V. Borodin may publish in the future.

Co-authorship network of co-authors of O. V. Borodin

This figure shows the co-authorship network connecting the top 25 collaborators of O. V. Borodin. A scholar is included among the top collaborators of O. V. Borodin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with O. V. Borodin. O. V. Borodin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	An improvement of Lebesgue’s description of edges in 3-polytopes and faces in plane quadrangulations 2019 ·Discrete Mathematics ·O. V. Borodin, A. O. Ivanova	2
2	All one-term tight descriptions of 3-paths in normal plane maps without K4−e 2018 ·Discrete Mathematics ·O. V. Borodin, A. O. Ivanova	1
3	Low 5-stars in normal plane maps with minimum degree 5 2016 ·Discrete Mathematics ·O. V. Borodin, A. O. Ivanova	2
4	The weight of faces in normal plane maps 2016 ·Discrete Mathematics ·O. V. Borodin, A. O. Ivanova	2
5	An analogue of Franklin’s Theorem 2016 ·Discrete Mathematics ·O. V. Borodin, A. O. Ivanova	7
6	Describing tight descriptions of 3-paths in triangle-free normal plane maps 2015 ·Discrete Mathematics ·O. V. Borodin, A. O. Ivanova	9
7	Low edges in 3-polytopes 2015 ·Discrete Mathematics ·O. V. Borodin, A. O. Ivanova	7
8	Planar 4-critical graphs with four triangles 2014 ·European Journal of Combinatorics ·O. V. Borodin, Zdenĕk Dvořák, Alexandr Kostochka, Bernard Lidický, (unknown)	4
9	LightC4andC5in 3-polytopes with minimum degree 5 2014 ·Discrete Mathematics ·O. V. Borodin, A. O. Ivanova, Douglas R. Woodall	4
10	Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 2013 ·Discrete Mathematics ·O. V. Borodin, A. O. Ivanova, Alexandr Kostochka	6
11	(k,j)-coloring of sparse graphs 2011 ·Discrete Applied Mathematics ·O. V. Borodin, A. O. Ivanova, Mickaël Montassier, André Raspaud	11
12	List 2-distance (Delta+2)-coloring of planar graphs with girth six. 2009 ·European Journal of Combinatorics ·O. V. Borodin, A. O. Ivanova	20
13	Planar graphs decomposable into a forest and a matching 2008 ·Discrete Mathematics ·O. V. Borodin, A. O. Ivanova, Alexandr Kostochka, (unknown)	2
14	Stars and bunches in planar graphs. Part I: Triangulations 2002 ·University of Twente Research Information ·O. V. Borodin, Hajo Broersma, A. N. Glebov, Jan van den Heuvel	7
15	Stars and bunches in planar graphs. Part II: General planar graphs and colourings 2002 ·University of Twente Research Information ·O. V. Borodin, Hajo Broersma, A. N. Glebov, Jan van den Heuvel	35
16	On cyclic colorings and their generalizations 1999 ·Discrete Mathematics ·O. V. Borodin, Daniel P. Sanders, Yue Zhao	27
17	Triangulated 3-polytopes without faces of low weight 1998 ·Discrete Mathematics ·O. V. Borodin	23
18	Total Colourings of Planar Graphs with Large Girth 1998 ·European Journal of Combinatorics ·O. V. Borodin, Alexandr Kostochka, Douglas R. Woodall	41
19	To the paper of H.L. Abbott and B. Zhou on 4-critical planar graphs. 1996 ·Ars Combinatoria ·O. V. Borodin	12
20	Simultaneous coloring of edges and faces of plane graphs 1994 ·Discrete Mathematics ·O. V. Borodin	22

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact