Oleg V. Borodin

发表

Preface: Russian Translations II

Oleg V. Borodin, 2004, Discret. Appl. Math..

On an upper bound of a graph's chromatic number, depending on the graph's degree and density

Alexandr V. Kostochka, Oleg V. Borodin, A. Kostochka, 1977, J. Comb. Theory B.

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, 2018, Discret. Math..

Acyclic 4-Choosability of Planar Graphs with No 4- and 5-Cycles

Oleg V. Borodin, Anna O. Ivanova, 2013, J. Graph Theory.

List injective colorings of planar graphs

Oleg V. Borodin, Anna O. Ivanova, 2011, Discret. Math..

Tight Descriptions of 3-Paths in Normal Plane Maps : Dedicated to Andre Raspaud on the occasion of his 70th birthday

Alexandr V. Kostochka, Oleg V. Borodin, Anna O. Ivanova, 2017, J. Graph Theory.

Short cycles of low weight in normal plane maps with minimum degree 5

Douglas R. Woodall, Oleg V. Borodin, 1998, Discuss. Math. Graph Theory.

A sufficient condition for planar graphs to be 3-colorable

André Raspaud, Oleg V. Borodin, A. Raspaud, 2003, J. Comb. Theory, Ser. B.

Weight of 3-Paths in Sparse Plane Graphs

Oleg V. Borodin, Anna O. Ivanova, V. A. Aksenov, 2015, Electron. J. Comb..

A new proof of the 6 color theorem

Oleg V. Borodin, 1995, J. Graph Theory.

List 2-distance (Delta+2)-coloring of planar graphs with girth six

Oleg V. Borodin, Anna O. Ivanova, 2009, Eur. J. Comb..

Triangles with restricted degree sum of their boundary vertices in plane graphs

Oleg V. Borodin, 1995, Discret. Math..

Joint extension of two theorems of Kotzig on 3-polytopes

Oleg V. Borodin, 1993, Comb..

Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles

André Raspaud, Oleg V. Borodin, Anna O. Ivanova, 2010, Discret. Math..

Triangulated 3-polytopes without faces of low weight

Oleg V. Borodin, 1998, Discret. Math..

Structural theorem on plane graphs with application to the entire coloring number

Oleg V. Borodin, 1996, J. Graph Theory.

Diagonal coloring of the vertices of triangulations

Oleg V. Borodin, 1992, Discret. Math..

Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices

Oleg V. Borodin, Anna O. Ivanova, D. V. Nikiforov, 2017, Discret. Math..

Four problems on plane graphs raised by Branko Grünbaum

Oleg V. Borodin, 1991, Graph Structure Theory.

Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable

André Raspaud, Alexei N. Glebov, Oleg V. Borodin, 2010, Discret. Math..

Colorings of plane graphs: A survey

Oleg V. Borodin, O. Borodin, 2013, Discret. Math..

Height of minor faces in plane normal maps

Oleg V. Borodin, D. V. Loparev, 2004, Discret. Appl. Math..

On acyclic colorings of planar graphs

Oleg V. Borodin, O. Borodin, 2006, Discret. Math..

On Deeply Critical Oriented Graphs

André Raspaud, Alexandr V. Kostochka, Éric Sopena, 2001, J. Comb. Theory, Ser. B.

Diagonal 11-coloring of plane triangulations

Oleg V. Borodin, 1990, J. Graph Theory.

On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5

Oleg V. Borodin, Anna O. Ivanova, 2017, Discret. Math..

2-distance (Delta+2)-coloring of planar graphs with girth six and Delta>=18

Oleg V. Borodin, Anna O. Ivanova, 2009, Discret. Math..

Decompositions of quadrangle-free planar graphs

Alexandr V. Kostochka, Oleg V. Borodin, Anna O. Ivanova, 2009, Discuss. Math. Graph Theory.

Describing faces in plane triangulations

Alexandr V. Kostochka, Oleg V. Borodin, Anna O. Ivanova, 2014, Discret. Math..

Distant-2-colouring in planar graphs

Haitze J. Broersma, Oleg V. Borodin, A. S. Glebov, 2001 .

Low 5-Stars at 5-Vertices in 3-Polytopes with Minimum Degree 5 and No Vertices of Degree from 7 to 9

Mikhail A. Bykov, Oleg V. Borodin, Anna O. Ivanova, 2020, Discuss. Math. Graph Theory.

Cyclic degree and cyclic coloring of 3-polytopes

Oleg V. Borodin, 1996, J. Graph Theory.

All Tight Descriptions of 4-Paths in 3-Polytopes with Minimum Degree 5

Oleg V. Borodin, Anna O. Ivanova, Ts. Ch.-D. Batueva, 2017, Graphs Comb..

M-degrees of quadrangle-free planar graphs

Alexandr V. Kostochka, Gexin Yu, Oleg V. Borodin, 2009, J. Graph Theory.

Total Colourings of Planar Graphs with Large Girth

Alexandr V. Kostochka, Douglas R. Woodall, Oleg V. Borodin, 1998, Eur. J. Comb..

The weight of faces in normal plane maps

Oleg V. Borodin, Anna O. Ivanova, 2016, Discret. Math..

A Steinberg-Like Approach to Describing Faces in 3-Polytopes

Oleg V. Borodin, Anna O. Ivanova, E. I. Vasil'eva, 2017, Graphs Comb..

Short proofs of coloring theorems on planar graphs

Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey, 2014, Eur. J. Comb..

Low 5-stars in normal plane maps with minimum degree 5

Oleg V. Borodin, Anna O. Ivanova, 2017, Discret. Math..

Structural properties of plane graphs without adjacent triangles and an application to 3-colorings

Oleg V. Borodin, 1996, J. Graph Theory.

An Extension of Kotzig’s Theorem

Oleg V. Borodin, Anna O. Ivanova, V. A. Aksenov, 2016, Discuss. Math. Graph Theory.

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, 2018, Discuss. Math. Graph Theory.

An analogue of Franklin's Theorem

Oleg V. Borodin, Anna O. Ivanova, 2016, Discret. Math..

Decomposition of K13 into a torus graph and a graph imbedded in the Klein bottle

Jean Mayer, Oleg V. Borodin, 1992, Discret. Math..

Preface

Oleg V. Borodin, 2001, Discret. Appl. Math..

Describing 3-paths in normal plane maps

Alexandr V. Kostochka, Tommy R. Jensen, Matthew P. Yancey, 2013, Discret. Math..

Refined weight of edges in normal plane maps

Mikhail A. Bykov, Oleg V. Borodin, Anna O. Ivanova, 2017, Discret. Math..

Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable

André Raspaud, Mickaël Montassier, Alexei N. Glebov, 2009, J. Comb. Theory, Ser. B.

Simultaneous coloring of edges and faces of plane graphs

Oleg V. Borodin, 1994, Discret. Math..

List Edge and List Total Colourings of Multigraphs

Alexandr V. Kostochka, Douglas R. Woodall, Oleg V. Borodin, 1997, J. Comb. Theory B.

Cyclic Degrees of 3-Polytopes

Douglas R. Woodall, Oleg V. Borodin, 1999, Graphs Comb..

Decomposing a planar graph with girth 9 into a forest and a matching

Alexandr V. Kostochka, Gexin Yu, Oleg V. Borodin, 2008, Eur. J. Comb..

List 2-facial 5-colorability of plane graphs with girth at least 12

Oleg V. Borodin, Anna O. Ivanova, 2012, Discret. Math..

On the Weight of Minor Faces in Triangle-Free 3-Polytopes

Oleg V. Borodin, Anna O. Ivanova, 2016, Discuss. Math. Graph Theory.

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, 2019, Discret. Math..

On acyclic colorings of planar graphs

Oleg V. Borodin, 1979, Discret. Math..

All one-term tight descriptions of 3-paths in normal plane maps without K4-e

Oleg V. Borodin, Anna O. Ivanova, 2018, Discret. Math..

(k, J)-coloring of Sparse Graphs

André Raspaud, Mickaël Montassier, Oleg V. Borodin, 2011, Discret. Appl. Math..

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, 2020, Discuss. Math. Graph Theory.

A new proof of Grünbaum's 3 color theorem

Oleg V. Borodin, 1997, Discret. Math..

Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11

Alexandr V. Kostochka, Oleg V. Borodin, Anna O. Ivanova, 2014, Discret. Math..

On kernel-perfect orientations of line graphs

Alexandr V. Kostochka, Douglas R. Woodall, Oleg V. Borodin, 1998, Discret. Math..

To the paper of H.L. Abbott and B. Zhou on 4-critical planar graphs

Oleg V. Borodin, O. Borodin, 1996, Ars Comb..

Every Triangulated 3-Polytope of Minimum Degree 4 has a 4-Path of Weight at Most 27

Oleg V. Borodin, Anna O. Ivanova, 2016, Electron. J. Comb..

Describing tight descriptions of 3-paths in triangle-free normal plane maps

Oleg V. Borodin, Anna O. Ivanova, 2015, Discret. Math..

Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5

Oleg V. Borodin, Anna O. Ivanova, 2013, Discret. Math..

Planar graphs with neither 5‐cycles nor close 3‐cycles are 3‐colorable

Alexei N. Glebov, Oleg V. Borodin, O. Borodin, 2011, J. Graph Theory.

On 11-improper 22-coloring of sparse graphs

Alexandr V. Kostochka, Matthew P. Yancey, Oleg V. Borodin, 2013, Discret. Math..

Irreducible graphs in the Grünbaum-Havel 3-colour problem

Oleg V. Borodin, 1996, Discret. Math..

Acyclic 3-choosability of sparse graphs with girth at least 7

Min Chen, André Raspaud, Oleg V. Borodin, 2010, Discret. Math..

Deeply asymmetric planar graphs

Michael Stiebitz, Gert Sabidussi, Oleg V. Borodin, 2005, J. Comb. Theory, Ser. B.

Describing faces in 3-polytopes with no vertices of degree from 5 to 7

Oleg V. Borodin, A. O. Ivanova, 2019, Discret. Math..

More About the Height of Faces in 3-Polytopes

Mikhail A. Bykov, Oleg V. Borodin, Anna O. Ivanova, 2018, Discuss. Math. Graph Theory.

Describing 3-faces in normal plane maps with minimum degree 4

Oleg V. Borodin, Anna O. Ivanova, 2013, Discret. Math..

A step towards the strong version of Havel's three color conjecture

Alexei N. Glebov, Tommy R. Jensen, Oleg V. Borodin, 2012, J. Comb. Theory, Ser. B.

Weight of edges in normal plane maps

Oleg V. Borodin, Anna O. Ivanova, 2016, Discret. Math..

Acyclic 4-choosability of planar graphs without adjacent short cycles

Oleg V. Borodin, Anna O. Ivanova, 2012, Discret. Math..

Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k

André Raspaud, Mickaël Montassier, Pascal Ochem, 2010, J. Graph Theory.

5-Stars of Low Weight in Normal Plane Maps with Minimum Degree 5

Tommy R. Jensen, Oleg V. Borodin, Anna O. Ivanova, 2014, Discuss. Math. Graph Theory.

Defective 2-colorings of sparse graphs

Alexandr V. Kostochka, Oleg V. Borodin, A. Kostochka, 2014, J. Comb. Theory B.

Planar 4-critical graphs with four triangles

Alexandr V. Kostochka, Zdenek Dvorak, Bernard Lidický, 2014, Eur. J. Comb..

(k, 1)-coloring of Sparse Graphs

André Raspaud, Mickaël Montassier, Oleg V. Borodin, 2012, Discret. Math..

Cyclic coloring of plane graphs

Oleg V. Borodin, 1992, Discret. Math..

Minimal vertex degree sum of a 3-path in plane maps

Oleg V. Borodin, 1997, Discuss. Math. Graph Theory.

An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations

Oleg V. Borodin, Anna O. Ivanova, 2019, Discret. Math..

2-distance 4-colorability of Planar Subcubic Graphs with Girth at Least 22

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2012, Discuss. Math. Graph Theory.

On the maximum average degree and the oriented chromatic number of a graph

André Raspaud, Alexandr V. Kostochka, Jaroslav Nesetril, 1999, Discret. Math..

Total colorings of planar graphs with large maximum degree

Alexandr V. Kostochka, Douglas R. Woodall, Oleg V. Borodin, 1997, J. Graph Theory.

Low minor faces in 3-polytopes

Oleg V. Borodin, Anna O. Ivanova, 2018, Discret. Math..

Precise Upper Bound for the Strong Edge Chromatic Number of Sparse Planar Graphs

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2013, Discuss. Math. Graph Theory.

On cyclic colorings and their generalizations

Yue Zhao, Oleg V. Borodin, Daniel P. Sanders, 1999, Discret. Math..

Planar graphs without adjacent cycles of length at most seven are 3-colorable

André Raspaud, Mickaël Montassier, Oleg V. Borodin, 2010, Discret. Math..

Acyclic colouring of 1-planar graphs

André Raspaud, Alexandr V. Kostochka, Éric Sopena, 2001, Discret. Appl. Math..

Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable

Oleg V. Borodin, Anna O. Ivanova, 2009, J. Graph Theory.

Planar graphs decomposable into a forest and a matching

Alexandr V. Kostochka, Oleg V. Borodin, Anna O. Ivanova, 2009, Discret. Math..

List strong linear 2‐arboricity of sparse graphs

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2011, J. Graph Theory.

On universal graphs for planar oriented graphs of a given girth

André Raspaud, Alexandr V. Kostochka, Jaroslav Nesetril, 1998, Discret. Math..

Acyclic list 7‐coloring of planar graphs

André Raspaud, Alexandr V. Kostochka, Éric Sopena, 2002, J. Graph Theory.

All Tight Descriptions of 3-Stars in 3-Polytopes with Girth 5

Oleg V. Borodin, Anna O. Ivanova, 2017, Discuss. Math. Graph Theory.

Cyclic Colorings of 3-Polytopes with Large Maximum Face Size

Douglas R. Woodall, Oleg V. Borodin, D. R. Woodall, 2002, SIAM J. Discret. Math..

Light C4 and C5 in 3-polytopes with minimum degree 5

Douglas R. Woodall, Oleg V. Borodin, Anna O. Ivanova, 2014, Discret. Math..

Low edges in 3-polytopes

Oleg V. Borodin, Anna O. Ivanova, 2015, Discret. Math..

A new upper bound on the cyclic chromatic number

Jan van den Heuvel, Alexei N. Glebov, Hajo Broersma, 2007, J. Graph Theory.

Planar graphs without cycles of length from 4 to 7 are 3-colorable

André Raspaud, Mohammad R. Salavatipour, Alexei N. Glebov, 2005, J. Comb. Theory, Ser. B.

Homomorphisms from sparse graphs with large girth

Alexandr V. Kostochka, Seog-Jin Kim, Douglas B. West, 2004, J. Comb. Theory, Ser. B.

Variable degeneracy: extensions of Brooks' and Gallai's theorems

Alexandr V. Kostochka, Oleg V. Borodin, Bjarne Toft, 2000, Discret. Math..

Describing (d-2)-stars at d-vertices, d≤5, in normal plane maps

Oleg V. Borodin, Anna O. Ivanova, 2013, Discret. Math..

Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices

Oleg V. Borodin, Anna O. Ivanova, 2016, Discret. Math..

All tight descriptions of 3-paths in plane graphs with girth at least 7

Oleg V. Borodin, Anna O. Ivanova, 2021, Discret. Math..

Heights of Minor Faces in 3-Polytopes

Oleg V. Borodin, A. O. Ivanova, 2021 .

Stars and bunches in planar graphs. Part II: General planar graphs and colourings

Hajo Broersma, Oleg V. Borodin, J. V. D. Heuvel, 2002 .

Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces

Oleg V. Borodin, O. Borodin, 1993 .

Structural Properties and Colorings of Plane Graphs

Oleg V. Borodin, 1992 .

( 5 , 2 )-Coloring of Sparse Graphs

Alexandr V. Kostochka, Stephen G. Hartke, Douglas B. West, 2007 .

On Light Edges and Triangles in Planar Graphs of Minimum Degree Five

Oleg V. Borodin, Daniel P. Sanders, 2006 .

Low and light 5-stars in 3-polytopes with minimum degree 5 and restrictions on the degrees of major vertices

Oleg V. Borodin, Anna O. Ivanova, D. V. Nikiforov, 2017 .

Structural theorem on plane graphs with application to the entire coloring number

Oleg V. Borodin, 1996 .

Total colorings of planar graphs with large maximum degree

Alexandr V. Kostochka, Douglas R. Woodall, Oleg V. Borodin, 1997 .

List 2-distance (Δ + 1)-coloring of planar graphs with given girth

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2008 .

2-distance coloring of sparse planar graphs.

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2004 .

MINIMAX DEGREES OF QUASIPLANAR GRAPHS WITH NO SHORT CYCLES OTHER THAN TRIANGLES

Alexandr V. Kostochka, Oleg V. Borodin, Anna O. Ivanova, 2008 .

Near-proper vertex 2-colorings of sparse graphs

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2010 .

M-degrees of quadrangle-free planar graphs

Alexandr V. Kostochka, Gexin Yu, Oleg V. Borodin, 2009 .

Oriented 5-coloring of sparse plane graphs

Alexandr V. Kostochka, Oleg V. Borodin, Anna O. Ivanova, 2007 .

Acyclic 4-coloring of planar graphs without 4- and 5-cycles

Oleg V. Borodin, 2011 .

New results about the structure of plane graphs: A survey

Oleg V. Borodin, Anna O. Ivanova, 2017 .

Circuit decompositions of join-covered graphs

Oleg V. Borodin, Anna O. Ivanova, C. Little, 2009 .

Injective (Δ + 1)-coloring of planar graphs with girth 6

Oleg V. Borodin, Anna O. Ivanova, 2011 .

2-Distance 4-coloring of planar subcubic graphs

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2011 .

The vertex-face weight of edges in 3-polytopes

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2015 .

A structural theorem on planar triangulations in terms of bunches and stars

Haitze J. Broersma, Oleg V. Borodin, J.P.M. van den Heuvel, 2001 .

On the total coloring of planar graphs.

Oleg V. Borodin, O. Borodin, 1989 .

Computing Light Edges in Planar Graphs

Oleg V. Borodin, 1990 .

Weight of faces in plane maps

Douglas R. Woodall, Oleg V. Borodin, 1998 .

Acyclic 5-choosability of planar graphs without 4-cycles

Oleg V. Borodin, Anna O. Ivanova, 2011 .

Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k

André Raspaud, Mickaël Montassier, Pascal Ochem, 2010 .

CIRCULAR (5;2)-COLORING OF SPARSE GRAPHS

Alexandr V. Kostochka, Douglas B. West, Oleg V. Borodin, 2008 .

A new upper bound on the cyclic chromatic number

Hajo Broersma, Oleg V. Borodin, J. van den Heuvel, 2007 .

Stars and bunches in planar graphs. Part I: Triangulations

Hajo Broersma, Oleg V. Borodin, J. V. D. Heuvel, 2002 .

Structural properties of plane graphs without adjacent triangles and an application to 3-colorings

Oleg V. Borodin, O. Borodin, 1996, J. Graph Theory.

Decomposing a planar graph into a forest and a subgraph of restricted maximum degree.

Oleg V. Borodin, B. S. Stechkin, A. O. Ivanova, 2007 .

List 2-distance (Δ + 2)-coloring of planar graphs with girth 6 and Δ ≥ 24

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2009 .

Light and low 5-stars in normal plane maps with minimum degree 5

Oleg V. Borodin, Anna O. Ivanova, 2016 .

Sufficient conditions for planar graphs to be 2-distance ()-colourable.

Oleg V. Borodin, Anna O. Ivanova, O. Borodin, 2004 .

Acyclic 5-choosability of planar graphs without adjacent short cycles

Oleg V. Borodin, Anna O. Ivanova, 2011, J. Graph Theory.

Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6.

Oleg V. Borodin, Anna O. Ivanova, T. K. Neustroeva, 2006 .

Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1

Alexandr V. Kostochka, Oleg V. Borodin, A. Kostochka, 2011 .