On an upper bound of a graph's chromatic number, depending on the graph's degree and density. - Oleg V. Borodin; Alexandr V. Kostochka (J. Comb. Theory B, 1977)

Diagonal 11-coloring of plane triangulations. - Oleg V. Borodin (J. Graph Theory, 1990)

Four problems on plane graphs raised by Branko Grünbaum. - Oleg V. Borodin (Graph Structure Theory, 1991)

Cyclic coloring of plane graphs. - Oleg V. Borodin (Discret. Math., 1992)

Diagonal coloring of the vertices of triangulations. - Oleg V. Borodin (Discret. Math., 1992)

Decomposition of K13 into a torus graph and a graph imbedded in the Klein bottle. - Oleg V. Borodin; Jean Mayer (Discret. Math., 1992)

Joint extension of two theorems of Kotzig on 3-polytopes. - Oleg V. Borodin (Comb., 1993)

Simultaneous coloring of edges and faces of plane graphs. - Oleg V. Borodin (Discret. Math., 1994)

Triangles with restricted degree sum of their boundary vertices in plane graphs. - Oleg V. Borodin (Discret. Math., 1995)

A new proof of the 6 color theorem. - Oleg V. Borodin (J. Graph Theory, 1995)

To the paper of H.L. Abbott and B. Zhou on 4-critical planar graphs. - Oleg V. Borodin (Ars Comb., 1996)

Irreducible graphs in the Grünbaum-Havel 3-colour problem. - Oleg V. Borodin (Discret. Math., 1996)

Cyclic degree and cyclic coloring of 3-polytopes. - Oleg V. Borodin (J. Graph Theory, 1996)

Structural theorem on plane graphs with application to the entire coloring number. - Oleg V. Borodin (J. Graph Theory, 1996)

Structural properties of plane graphs without adjacent triangles and an application to 3-colorings. - Oleg V. Borodin (J. Graph Theory, 1996)

A new proof of Grünbaum's 3 color theorem. - Oleg V. Borodin (Discret. Math., 1997)

Minimal vertex degree sum of a 3-path in plane maps. - Oleg V. Borodin (Discuss. Math. Graph Theory, 1997)

List Edge and List Total Colourings of Multigraphs. - Oleg V. Borodin; Alexandr V. Kostochka; Douglas R. Woodall (J. Comb. Theory B, 1997)

Total colorings of planar graphs with large maximum degree. - Oleg V. Borodin; Alexandr V. Kostochka; Douglas R. Woodall (J. Graph Theory, 1997)

Triangulated 3-polytopes without faces of low weight. - Oleg V. Borodin (Discret. Math., 1998)

On universal graphs for planar oriented graphs of a given girth. - Oleg V. Borodin; Alexandr V. Kostochka; Jaroslav Nesetril; André Raspaud; Éric Sopena (Discret. Math., 1998)

On kernel-perfect orientations of line graphs. - Oleg V. Borodin; Alexandr V. Kostochka; Douglas R. Woodall (Discret. Math., 1998)

Short cycles of low weight in normal plane maps with minimum degree 5. - Oleg V. Borodin; Douglas R. Woodall (Discuss. Math. Graph Theory, 1998)

Total Colourings of Planar Graphs with Large Girth. - Oleg V. Borodin; Alexandr V. Kostochka; Douglas R. Woodall (Eur. J. Comb., 1998)

On the maximum average degree and the oriented chromatic number of a graph. - Oleg V. Borodin; Alexandr V. Kostochka; Jaroslav Nesetril; André Raspaud; Éric Sopena (Discret. Math., 1999)

On cyclic colorings and their generalizations. - Oleg V. Borodin; Daniel P. Sanders 001; Yue Zhao 008 (Discret. Math., 1999)

Cyclic Degrees of 3-Polytopes. - Oleg V. Borodin; Douglas R. Woodall (Graphs Comb., 1999)

Variable degeneracy: extensions of Brooks' and Gallai's theorems. - Oleg V. Borodin; Alexandr V. Kostochka; Bjarne Toft (Discret. Math., 2000)

Preface. - Oleg V. Borodin (Discret. Appl. Math., 2001)

Acyclic colouring of 1-planar graphs. - Oleg V. Borodin; Alexandr V. Kostochka; André Raspaud; Éric Sopena (Discret. Appl. Math., 2001)

On Deeply Critical Oriented Graphs. - Oleg V. Borodin; Dmitry Fon-Der-Flaass; Alexandr V. Kostochka; André Raspaud; Éric Sopena (J. Comb. Theory B, 2001)

Acyclic list 7-coloring of planar graphs. - Oleg V. Borodin; Dmitry Fon-Der-Flaass; Alexandr V. Kostochka; André Raspaud; Éric Sopena (J. Graph Theory, 2002)

Cyclic Colorings of 3-Polytopes with Large Maximum Face Size. - Oleg V. Borodin; Douglas R. Woodall (SIAM J. Discret. Math., 2002)

A sufficient condition for planar graphs to be 3-colorable. - Oleg V. Borodin; André Raspaud (J. Comb. Theory B, 2003)

Preface: Russian Translations II. - Oleg V. Borodin (Discret. Appl. Math., 2004)

Height of minor faces in plane normal maps. - Oleg V. Borodin; D. V. Loparev (Discret. Appl. Math., 2004)

Homomorphisms from sparse graphs with large girth. - Oleg V. Borodin; Seog-Jin Kim; Alexandr V. Kostochka; Douglas B. West (J. Comb. Theory B, 2004)

Deeply asymmetric planar graphs. - V. A. Aksionov; Oleg V. Borodin; Leonid S. Melnikov; Gert Sabidussi; Michael Stiebitz; Bjarne Toft (J. Comb. Theory B, 2005)

Planar graphs without cycles of length from 4 to 7 are 3-colorable. - Oleg V. Borodin; Alexei N. Glebov; André Raspaud; Mohammad R. Salavatipour (J. Comb. Theory B, 2005)

On acyclic colorings of planar graphs. - Oleg V. Borodin (Discret. Math., 2006)

A new upper bound on the cyclic chromatic number. - Oleg V. Borodin; Hajo Broersma; Alexei N. Glebov; Jan van den Heuvel (J. Graph Theory, 2007)

Decomposing a planar graph with girth 9 into a forest and a matching. - Oleg V. Borodin; Alexandr V. Kostochka; Naeem N. Sheikh; Gexin Yu (Eur. J. Comb., 2008)

2-distance (Delta+2)-coloring of planar graphs with girth six and Delta>=18. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2009)

Planar graphs decomposable into a forest and a matching. - Oleg V. Borodin; Anna O. Ivanova; Alexandr V. Kostochka; Naeem N. Sheikh (Discret. Math., 2009)

Decompositions of quadrangle-free planar graphs. - Oleg V. Borodin; Anna O. Ivanova; Alexandr V. Kostochka; Naeem N. Sheikh (Discuss. Math. Graph Theory, 2009)

List 2-distance (Delta+2)-coloring of planar graphs with girth six. - Oleg V. Borodin; Anna O. Ivanova (Eur. J. Comb., 2009)

Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. - Oleg V. Borodin; Alexei N. Glebov; Mickaël Montassier; André Raspaud (J. Comb. Theory B, 2009)

Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable. - Oleg V. Borodin; Anna O. Ivanova (J. Graph Theory, 2009)

M-degrees of quadrangle-free planar graphs. - Oleg V. Borodin; Alexandr V. Kostochka; Naeem N. Sheikh; Gexin Yu (J. Graph Theory, 2009)

Acyclic 3-choosability of sparse graphs with girth at least 7. - Oleg V. Borodin; Min Chen 012; Anna O. Ivanova; André Raspaud (Discret. Math., 2010)

Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. - Oleg V. Borodin; Alexei N. Glebov; André Raspaud (Discret. Math., 2010)

Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles. - Oleg V. Borodin; Anna O. Ivanova; André Raspaud (Discret. Math., 2010)

Planar graphs without adjacent cycles of length at most seven are 3-colorable. - Oleg V. Borodin; Mickaël Montassier; André Raspaud (Discret. Math., 2010)

Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. - Oleg V. Borodin; Anna O. Ivanova; Mickaël Montassier; Pascal Ochem; André Raspaud (J. Graph Theory, 2010)

(k, j)-coloring of sparse graphs. - Oleg V. Borodin; Anna O. Ivanova; Mickaël Montassier; André Raspaud (Discret. Appl. Math., 2011)

List injective colorings of planar graphs. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2011)

Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable. - Oleg V. Borodin; Alexei N. Glebov (J. Graph Theory, 2011)

List strong linear 2-arboricity of sparse graphs. - Oleg V. Borodin; Anna O. Ivanova (J. Graph Theory, 2011)

Acyclic 5-choosability of planar graphs without adjacent short cycles. - Oleg V. Borodin; Anna O. Ivanova (J. Graph Theory, 2011)

List 2-facial 5-colorability of plane graphs with girth at least 12. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2012)

Acyclic 4-choosability of planar graphs without adjacent short cycles. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2012)

(k, 1)-coloring of sparse graphs. - Oleg V. Borodin; Anna O. Ivanova; Mickaël Montassier; André Raspaud (Discret. Math., 2012)

2-distance 4-colorability of planar subcubic graphs with girth at least 22. - Oleg V. Borodin; Anna O. Ivanova (Discuss. Math. Graph Theory, 2012)

A step towards the strong version of Havel's three color conjecture. - Oleg V. Borodin; Alexei N. Glebov; Tommy R. Jensen (J. Comb. Theory B, 2012)

Colorings of plane graphs: A survey. - Oleg V. Borodin (Discret. Math., 2013)

Describing (d-2)-stars at d-vertices, d≤5, in normal plane maps. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2013)

Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2013)

Describing 3-faces in normal plane maps with minimum degree 4. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2013)

Describing 3-paths in normal plane maps. - Oleg V. Borodin; Anna O. Ivanova; Tommy R. Jensen; Alexandr V. Kostochka; Matthew P. Yancey (Discret. Math., 2013)

On 11-improper 22-coloring of sparse graphs. - Oleg V. Borodin; Alexandr V. Kostochka; Matthew P. Yancey (Discret. Math., 2013)

Precise upper bound for the strong edge chromatic number of sparse planar graphs. - Oleg V. Borodin; Anna O. Ivanova (Discuss. Math. Graph Theory, 2013)

Acyclic 4-Choosability of Planar Graphs with No 4- and 5-Cycles. - Oleg V. Borodin; Anna O. Ivanova (J. Graph Theory, 2013)

Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11. - Oleg V. Borodin; Anna O. Ivanova; Alexandr V. Kostochka (Discret. Math., 2014)

Describing faces in plane triangulations. - Oleg V. Borodin; Anna O. Ivanova; Alexandr V. Kostochka (Discret. Math., 2014)

Light C4 and C5 in 3-polytopes with minimum degree 5. - Oleg V. Borodin; Anna O. Ivanova; Douglas R. Woodall (Discret. Math., 2014)

5-stars of low weight in normal plane maps with minimum degree 5. - Oleg V. Borodin; Anna O. Ivanova; Tommy R. Jensen (Discuss. Math. Graph Theory, 2014)

Planar 4-critical graphs with four triangles. - Oleg V. Borodin; Zdenek Dvorák 001; Alexandr V. Kostochka; Bernard Lidický; Matthew P. Yancey (Eur. J. Comb., 2014)

Short proofs of coloring theorems on planar graphs. - Oleg V. Borodin; Alexandr V. Kostochka; Bernard Lidický; Matthew P. Yancey (Eur. J. Comb., 2014)

Defective 2-colorings of sparse graphs. - Oleg V. Borodin; Alexandr V. Kostochka (J. Comb. Theory B, 2014)

Weight of 3-Paths in Sparse Plane Graphs. - V. A. Aksenov; Oleg V. Borodin; Anna O. Ivanova (Electron. J. Comb., 2015)

Describing tight descriptions of 3-paths in triangle-free normal plane maps. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2015)

Low edges in 3-polytopes. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2015)

Every Triangulated 3-Polytope of Minimum Degree 4 has a 4-Path of Weight at Most 27. - Oleg V. Borodin; Anna O. Ivanova (Electron. J. Comb., 2016)

An analogue of Franklin's Theorem. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2016)

The weight of faces in normal plane maps. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2016)

Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2016)

Weight of edges in normal plane maps. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2016)

An extension of Kotzig's Theorem. - V. A. Aksenov; Oleg V. Borodin; Anna O. Ivanova (Discuss. Math. Graph Theory, 2016)

On the weight of minor faces in triangle-free polytopes. - Oleg V. Borodin; Anna O. Ivanova (Discuss. Math. Graph Theory, 2016)

Refined weight of edges in normal plane maps. - Tsyndyma Chimit-Dordjievna Batueva; Oleg V. Borodin; Mikhail A. Bykov; Anna O. Ivanova; Olesy N. Kazak; D. V. Nikiforov (Discret. Math., 2017)

Low 5-stars in normal plane maps with minimum degree 5. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2017)

On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2017)

Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices. - Oleg V. Borodin; Anna O. Ivanova; D. V. Nikiforov (Discret. Math., 2017)

All tight descriptions of 3-stars in 3-polytopes with girth 5. - Oleg V. Borodin; Anna O. Ivanova (Discuss. Math. Graph Theory, 2017)

All Tight Descriptions of 4-Paths in 3-Polytopes with Minimum Degree 5. - Tsyndyma Chimit-Dordjievna Batueva; Oleg V. Borodin; Anna O. Ivanova (Graphs Comb., 2017)

A Steinberg-Like Approach to Describing Faces in 3-Polytopes. - Oleg V. Borodin; Anna O. Ivanova; Ekaterina I. Vasil'eva (Graphs Comb., 2017)

Tight Descriptions of 3-Paths in Normal Plane Maps : Dedicated to Andre Raspaud on the occasion of his 70th birthday. - Oleg V. Borodin; Anna O. Ivanova; Alexandr V. Kostochka (J. Graph Theory, 2017)

Low minor faces in 3-polytopes. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2018)

All one-term tight descriptions of 3-paths in normal plane maps without K4-e. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2018)

Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7. - Oleg V. Borodin; Anna O. Ivanova; Olesy N. Kazak; Ekaterina I. Vasil'eva (Discret. Math., 2018)

More about the height of faces in 3-polytopes. - Oleg V. Borodin; Mikhail A. Bykov; Anna O. Ivanova (Discuss. Math. Graph Theory, 2018)

Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11. - Oleg V. Borodin; Anna O. Ivanova; Olesy N. Kazak (Discuss. Math. Graph Theory, 2018)

An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2019)

Describing faces in 3-polytopes with no vertices of degree from 5 to 7. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2019)

Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8. - Oleg V. Borodin; Anna O. Ivanova; Olesy N. Kazak (Discret. Math., 2019)

Low 5-stars at 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 7 to 9. - Oleg V. Borodin; Mikhail A. Bykov; Anna O. Ivanova (Discuss. Math. Graph Theory, 2020)

Light minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices. - Oleg V. Borodin; Anna O. Ivanova; Ekaterina I. Vasil'eva (Discuss. Math. Graph Theory, 2020)

All tight descriptions of 3-paths in plane graphs with girth at least 7. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2021)

Almost all about light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2022)

3-Vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2022)

Another tight description of faces in plane triangulations with minimum degree 4. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2022)

Tight description of faces of triangulations on the torus. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2023)

All tight descriptions of faces in plane triangulations with minimum degree 4. - Anna O. Ivanova; Oleg V. Borodin (Discuss. Math. Graph Theory, 2024)

Light 3-faces in 3-polytopes without adjacent triangles. - Oleg V. Borodin; Anna O. Ivanova (Discret. Math., 2025)

Tight description of faces in toroidal graphs with minimum degree at least 4. - Oleg V. Borodin; Anna O. Ivanova (Discuss. Math. Graph Theory, 2025)