Oleg V. Borodin

From MaRDI portal
Person:505455

Available identifiers

zbMath Open borodin.oleg-veniaminovichWikidataQ102909733 ScholiaQ102909733MaRDI QIDQ505455

List of research outcomes

PublicationDate of PublicationType
Light 3-paths in 3-polytopes without adjacent triangles2024-03-27Paper
Tight description of faces of triangulations on the torus2023-06-12Paper
Combinatorial structure of faces in triangulations on surfaces2022-08-03Paper
Another tight description of faces in plane triangulations with minimum degree 42022-06-14Paper
3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices2022-05-27Paper
Describing minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 or 72022-03-22Paper
Tight description of faces in torus triangulations with minimum degree 52021-12-08Paper
Almost all about light neighborhoods of 5-vertices in 3-polytopes with minimum degree 52021-11-23Paper
All tight descriptions of major 3-paths in 3-polytopes without 3-vertices2021-06-17Paper
A tight description of 3-polytopes by their major 3-paths2021-06-07Paper
Heights of minor faces in 3-polytopes2021-04-08Paper
All tight descriptions of 3-paths in plane graphs with girth at least 72021-03-25Paper
Soft 3-stars in sparse plane graphs2020-11-24Paper
An extension of Franklin's theorem2020-09-24Paper
Light minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices2020-08-26Paper
Low 5-stars at 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 7 to 92020-08-26Paper
All tight descriptions of 3-paths in plane graphs with girth 82020-05-21Paper
All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 62019-11-07Paper
Low faces of restricted degree in 3-polytopes2019-11-01Paper
Describing faces in 3-polytopes with no vertices of degree from 5 to 72019-09-11Paper
Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 82019-08-20Paper
Light minor 5-stars in 3-polytopes with minimum degree 52019-07-18Paper
An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations2019-06-27Paper
Light 3-stars in sparse plane graphs2019-05-08Paper
All tight descriptions of 3-paths in plane graphs with girth at least 92018-10-31Paper
Low minor faces in 3-polytopes2018-10-23Paper
All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\)2018-10-23Paper
Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 112018-06-29Paper
Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 52018-06-20Paper
More about the height of faces in 3-polytopes2018-03-23Paper
Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 72018-01-19Paper
Low and light 5-stars in 3-polytopes with minimum degree 5 and restrictions on the degrees of major vertices2017-10-27Paper
Refined weight of edges in normal plane maps2017-09-05Paper
Tight Descriptions of 3‐Paths in Normal Plane Maps2017-06-30Paper
The height of faces of 3-polytopes2017-06-30Paper
All tight descriptions of 4-paths in 3-polytopes with minimum degree 52017-06-29Paper
A Steinberg-like approach to describing faces in 3-polytopes2017-06-29Paper
On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 52017-06-23Paper
Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices2017-05-10Paper
Describing 4-paths in 3-polytopes with minimum degree 52017-02-15Paper
All tight descriptions of 3-stars in 3-polytopes with girth 52017-01-23Paper
Low 5-stars in normal plane maps with minimum degree 52016-12-14Paper
Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 272016-12-06Paper
Quantification of sampling uncertainty for molecular dynamics simulation: time-dependent diffusion coefficient in simple fluids2016-12-05Paper
An extension of Kotzig's theorem2016-11-11Paper
Light and low 5-stars in normal plane maps with minimum degree 52016-09-29Paper
Light neighborhoods of 5-vertices in 3-polytopes with minimum degree 52016-07-28Paper
On the weight of minor faces in triangle-free 3-polytopes2016-07-13Paper
An analogue of Franklin's theorem2016-06-16Paper
The weight of faces in normal plane maps2016-06-16Paper
Weight of edges in normal plane maps2016-04-07Paper
Heights of minor faces in triangle-free 3-polytopes2016-02-19Paper
The vertex-face weight of edges in 3-polytopes2016-01-06Paper
Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices2015-12-08Paper
The weight of edge in 3-polytopes2015-11-18Paper
Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 112015-11-16Paper
In memory of Dmitriĭ Germanovich Fon-Der-Flaass2015-11-16Paper
Weight of 3-paths in sparse plane graphs2015-11-02Paper
Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 152015-10-29Paper
Low edges in 3-polytopes2015-08-05Paper
Describing tight descriptions of 3-paths in triangle-free normal plane maps2015-06-29Paper
Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 42014-11-04Paper
Planar 4-critical graphs with four triangles2014-09-02Paper
Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 52014-08-14Paper
Precise upper bound for the strong edge chromatic number of sparse planar graphs2014-07-30Paper
5-stars of low weight in normal plane maps with minimum degree 52014-07-28Paper
Planar graphs without triangular 4-cycles are 3-choosable2014-06-13Paper
List 2-arboricity of planar graphs with no triangles at distance less than two2014-06-13Paper
Circular \((5,2)\)-coloring of sparse graphs2014-06-13Paper
Partitioning sparse plane graphs into two induced subgraphs of small degree2014-06-13Paper
Short proofs of coloring theorems on planar graphs2014-03-25Paper
Defective 2-colorings of sparse graphs2014-02-06Paper
Describing faces in plane triangulations2014-01-27Paper
On 1-improper 2-coloring of sparse graphs2014-01-24Paper
Describing 3-paths in normal plane maps2014-01-24Paper
Describing 3-faces in normal plane maps with minimum degree 42014-01-24Paper
Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 112014-01-16Paper
Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps2013-12-05Paper
Describing 4-stars at 5-vertices in normal plane maps with minimum degree 52013-12-05Paper
Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles2013-04-19Paper
Colorings of plane graphs: a survey2013-03-01Paper
https://portal.mardi4nfdi.de/entity/Q49062732013-02-11Paper
https://portal.mardi4nfdi.de/entity/Q49002862013-01-14Paper
A step towards the strong version of Havel's three color conjecture2013-01-14Paper
Acyclic 4-choosability of planar graphs without adjacent short cycles2012-10-26Paper
2-distance 4-colorability of planar subcubic graphs with girth at least 222012-09-05Paper
\((k,j)\)-coloring of sparse graphs2012-04-30Paper
\((k,1)\)-coloring of sparse graphs2012-04-13Paper
Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 12012-03-07Paper
https://portal.mardi4nfdi.de/entity/Q31151932012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31151992012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31152122012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31152542012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31155572012-02-10Paper
Oriented 5-coloring of sparse plane graphs2012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31156412012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31156732012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31157242012-02-10Paper
List 2-facial 5-colorability of plane graphs with girth at least 122012-01-11Paper
Acyclic 5-choosability of planar graphs without 4-cycles2011-10-25Paper
Acyclic 5-choosability of planar graphs without adjacent short cycles2011-10-12Paper
List strong linear 2-arboricity of sparse graphs2011-06-07Paper
Injective \((\Delta + 1)\)-coloring of planar graphs with girth 62011-05-19Paper
https://portal.mardi4nfdi.de/entity/Q53916312011-04-06Paper
Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable2011-01-20Paper
List injective colorings of planar graphs2011-01-07Paper
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k2010-11-10Paper
Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles2010-10-19Paper
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable2010-10-18Paper
Acyclic 3-choosability of sparse graphs with girth at least 72010-10-11Paper
Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable2009-12-18Paper
Planar graphs without adjacent cycles of length at most seven are 3-colorable2009-12-15Paper
2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)2009-12-15Paper
Decompositions of quadrangle-free planar graphs2009-08-03Paper
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable2009-06-23Paper
List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six2009-06-17Paper
M-degrees of quadrangle-free planar graphs2009-02-20Paper
Planar graphs decomposable into a forest and a matching2009-01-28Paper
Minimax degrees of quasiplanar graphs with no short cycles other than triangles2008-09-29Paper
Decomposing a planar graph with girth 9 into a forest and a matching2008-05-29Paper
Decomposing a planar graph into a forest and a subgraph of restricted maximum degree2008-04-14Paper
Minimax degrees of quasiplane graphs without 4-faces2008-04-14Paper
List \((p,q)\)-coloring of sparse plane graphs2007-07-02Paper
Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable2007-07-02Paper
Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 62007-07-02Paper
A new upper bound on the cyclic chromatic number2007-01-24Paper
An oriented 7-colouring of planar graphs with girth at least 72006-08-24Paper
An oriented colouring of planar graphs with girth at least 42006-08-24Paper
On acyclic colorings of planar graphs. (Reprint)2006-08-04Paper
2-distance coloring of sparse planar graphs2005-12-19Paper
Continuation of a 3-coloring from a 7-face onto a plane graph without \(C_3\)2005-12-19Paper
Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable2005-12-12Paper
Deeply asymmetric planar graphs2005-09-28Paper
Planar graphs without cycles of length from 4 to 7 are 3-colorable2005-03-08Paper
https://portal.mardi4nfdi.de/entity/Q48122332004-09-07Paper
https://portal.mardi4nfdi.de/entity/Q48118132004-09-06Paper
Homomorphisms from sparse graphs with large girth.2004-03-15Paper
A sufficient condition for planar graphs to be 3-colorable2003-08-25Paper
Estimating the minimal number of colors in acyclic \(k\)-strong colorings of maps on surfaces2003-06-15Paper
https://portal.mardi4nfdi.de/entity/Q47974622003-03-16Paper
https://portal.mardi4nfdi.de/entity/Q47974632003-03-16Paper
https://portal.mardi4nfdi.de/entity/Q47974652003-03-16Paper
https://portal.mardi4nfdi.de/entity/Q47974682003-03-16Paper
On deeply critical oriented graphs2002-12-10Paper
Acyclic colouring of 1-planar graphs2002-11-06Paper
Acyclic list 7‐coloring of planar graphs2002-07-11Paper
Cyclic Colorings of 3-Polytopes with Large Maximum Face Size2002-04-23Paper
https://portal.mardi4nfdi.de/entity/Q27606872001-12-13Paper
https://portal.mardi4nfdi.de/entity/Q27139882001-06-10Paper
Weight of faces in plane maps2001-04-16Paper
Variable degeneracy: Extensions of Brooks' and Gallai's theorems2000-12-03Paper
Triangulated \(3\)-polytopes without faces of low weight2000-11-02Paper
On universal graphs for planar oriented graphs of a given girth2000-11-02Paper
On kernel-perfect orientations of line graphs2000-11-02Paper
Acyclic \(k\)-strong coloring of maps on surfaces2000-10-16Paper
Acyclic Colourings of Planar Graphs with Large Girth2000-07-04Paper
https://portal.mardi4nfdi.de/entity/Q49367482000-01-31Paper
Cyclic degrees of 3-polytopes2000-01-30Paper
On cyclic colorings and their generalizations2000-01-11Paper
On the maximum average degree and the oriented chromatic number of a graph1999-11-29Paper
Short cycles of low weight in normal plane maps with minimum degree 51999-11-24Paper
Height of minor faces in plane normal maps1999-05-10Paper
https://portal.mardi4nfdi.de/entity/Q43862911998-10-19Paper
https://portal.mardi4nfdi.de/entity/Q42090441998-10-04Paper
Minimal vertex degree sum of a 3-path in plane maps1998-09-27Paper
Total colourings of planar graphs with large girth1998-04-07Paper
https://portal.mardi4nfdi.de/entity/Q43747131998-01-25Paper
Total colorings of planar graphs with large maximum degree1997-09-17Paper
List edge and list total colourings of multigraphs1997-09-15Paper
Cyclic degree and cyclic coloring of 3-polytopes1997-06-29Paper
A new proof of Grünbaum's 3 color theorem1997-06-16Paper
https://portal.mardi4nfdi.de/entity/Q48889281997-02-17Paper
https://portal.mardi4nfdi.de/entity/Q48824681997-01-13Paper
Irreducible graphs in the Grünbaum-Havel 3-colour problem1996-12-08Paper
Structural theorem on plane graphs with application to the entire coloring number1996-11-12Paper
Structural properties of plane graphs without adjacent triangles and an application to 3-colorings1996-02-25Paper
https://portal.mardi4nfdi.de/entity/Q48465471995-08-27Paper
A new proof of the 6 color theorem1995-08-16Paper
Triangles with restricted degree sum of their boundary vertices in plane graphs1995-02-06Paper
On Light Edges and Triangles in Planar Graphs of Minimum Degree Five1995-02-02Paper
https://portal.mardi4nfdi.de/entity/Q33645251995-01-01Paper
Bidegree of graph and degeneracy number1994-07-13Paper
Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces1994-07-13Paper
Simultaneous coloring of edges and faces of plane graphs1994-05-05Paper
https://portal.mardi4nfdi.de/entity/Q42738401994-01-13Paper
Joint extension of two theorems of Kotzig on 3-polytopes1993-08-16Paper
Structural Properties of Planar Maps with the Minimal Degree 51993-04-20Paper
https://portal.mardi4nfdi.de/entity/Q40271481993-02-21Paper
https://portal.mardi4nfdi.de/entity/Q40272081993-02-21Paper
https://portal.mardi4nfdi.de/entity/Q40220621993-01-17Paper
https://portal.mardi4nfdi.de/entity/Q40213761993-01-16Paper
Cyclic coloring of plane graphs1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40050191992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40134531992-09-27Paper
Diagonal coloring of the vertices of triangulations1992-09-27Paper
Decomposition of \(K_{13}\) into a torus graph and a graph imbedded in the Klein bottle1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39872211992-06-28Paper
Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs1992-06-25Paper
A characterization of chromatically rigid polynomials1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q52030481991-01-01Paper
Diagonal 11-coloring of plane triangulations1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32030381990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33602181990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34848511990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34691141989-01-01Paper
Representing of K13 as a 2-pire map on the Klein bottle.1989-01-01Paper
On the total coloring of planar graphs.1989-01-01Paper
Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34873641988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37840931987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38072291986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37441791985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36792121984-01-01Paper
Proof of Simoes-Pereira's conjectures on locally k-degenerate graphs.1980-01-01Paper
On acyclic colorings of planar graphs1979-01-01Paper
On an upper bound of the graph's chromatic number, depending on the graph's degree and density1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38598221976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41372021976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40521531974-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Oleg V. Borodin