2009 |
34 | EE | Oleg V. Borodin,
Anna O. Ivanova,
Alexandr V. Kostochka,
Naeem N. Sheikh:
Planar graphs decomposable into a forest and a matching.
Discrete Mathematics 309(1): 277-279 (2009) |
33 | EE | Oleg V. Borodin,
Alexandr V. Kostochka,
Naeem N. Sheikh,
Gexin Yu:
M-degrees of quadrangle-free planar graphs.
Journal of Graph Theory 60(1): 80-85 (2009) |
2008 |
32 | EE | Oleg V. Borodin,
Alexandr V. Kostochka,
Naeem N. Sheikh,
Gexin Yu:
Decomposing a planar graph with girth 9 into a forest and a matching.
Eur. J. Comb. 29(5): 1235-1241 (2008) |
2007 |
31 | EE | Oleg V. Borodin,
Hajo Broersma,
Alexei N. Glebov,
J. van den Heuvel:
A new upper bound on the cyclic chromatic number.
Journal of Graph Theory 54(1): 58-72 (2007) |
2006 |
30 | EE | Oleg V. Borodin:
On acyclic colorings of planar graphs.
Discrete Mathematics 306(10-11): 953-972 (2006) |
2005 |
29 | EE | Oleg V. Borodin,
Alexei N. Glebov,
André Raspaud,
Mohammad R. Salavatipour:
Planar graphs without cycles of length from 4 to 7 are 3-colorable.
J. Comb. Theory, Ser. B 93(2): 303-311 (2005) |
28 | EE | V. A. Aksionov,
Oleg V. Borodin,
Leonid S. Melnikov,
Gert Sabidussi,
Michael Stiebitz,
Bjarne Toft:
Deeply asymmetric planar graphs.
J. Comb. Theory, Ser. B 95(1): 68-78 (2005) |
2004 |
27 | EE | Oleg V. Borodin:
Preface: Russian Translations II.
Discrete Applied Mathematics 135(1-3): 1- (2004) |
26 | EE | Oleg V. Borodin,
D. V. Loparev:
Height of minor faces in plane normal maps.
Discrete Applied Mathematics 135(1-3): 31-39 (2004) |
25 | EE | Oleg V. Borodin,
Seog-Jin Kim,
Alexandr V. Kostochka,
Douglas B. West:
Homomorphisms from sparse graphs with large girth.
J. Comb. Theory, Ser. B 90(1): 147-159 (2004) |
2003 |
24 | EE | Oleg V. Borodin,
André Raspaud:
A sufficient condition for planar graphs to be 3-colorable.
J. Comb. Theory, Ser. B 88(1): 17-27 (2003) |
2002 |
23 | EE | Oleg V. Borodin,
Douglas R. Woodall:
Cyclic Colorings of 3-Polytopes with Large Maximum Face Size.
SIAM J. Discrete Math. 15(2): 143-154 (2002) |
2001 |
22 | | Oleg V. Borodin:
Preface.
Discrete Applied Mathematics 114(1-3): 1 (2001) |
21 | | Oleg V. Borodin,
Alexandr V. Kostochka,
André Raspaud,
Eric Sopena:
Acyclic colouring of 1-planar graphs.
Discrete Applied Mathematics 114(1-3): 29-41 (2001) |
20 | EE | Oleg V. Borodin,
Dmitry Fon-Der-Flaass,
Alexandr V. Kostochka,
André Raspaud,
Eric Sopena:
On Deeply Critical Oriented Graphs.
J. Comb. Theory, Ser. B 81(1): 150-155 (2001) |
2000 |
19 | EE | Oleg V. Borodin,
Alexandr V. Kostochka,
Bjarne Toft:
Variable degeneracy: extensions of Brooks' and Gallai's theorems.
Discrete Mathematics 214(1-3): 101-112 (2000) |
1999 |
18 | EE | Oleg V. Borodin,
Daniel P. Sanders,
Yue Zhao:
On cyclic colorings and their generalizations.
Discrete Mathematics 203(1-3): 23-40 (1999) |
17 | EE | Oleg V. Borodin,
Alexandr V. Kostochka,
Jaroslav Nesetril,
André Raspaud,
Eric Sopena:
On the maximum average degree and the oriented chromatic number of a graph.
Discrete Mathematics 206(1-3): 77-89 (1999) |
1998 |
16 | EE | Oleg V. Borodin:
Triangulated 3-polytopes without faces of low weight.
Discrete Mathematics 186(1-3): 281-285 (1998) |
15 | EE | Oleg V. Borodin,
Alexandr V. Kostochka,
Jaroslav Nesetril,
André Raspaud,
Eric Sopena:
On universal graphs for planar oriented graphs of a given girth.
Discrete Mathematics 188(1-3): 73-85 (1998) |
14 | EE | Oleg V. Borodin,
Alexandr V. Kostochka,
Douglas R. Woodall:
On kernel-perfect orientations of line graphs.
Discrete Mathematics 191(1-3): 45-49 (1998) |
13 | EE | Oleg V. Borodin,
Alexandr V. Kostochka,
Douglas R. Woodall:
Total Colourings of Planar Graphs with Large Girth.
Eur. J. Comb. 19(1): 19-24 (1998) |
1997 |
12 | EE | Oleg V. Borodin:
A new proof of Grünbaum's 3 color theorem.
Discrete Mathematics 169(1-3): 177-183 (1997) |
11 | EE | Oleg V. Borodin,
Alexandr V. Kostochka,
Douglas R. Woodall:
List Edge and List Total Colourings of Multigraphs.
J. Comb. Theory, Ser. B 71(2): 184-204 (1997) |
1996 |
10 | | Oleg V. Borodin:
To the paper of H.L. Abbott and B. Zhou on 4-critical planar graphs.
Ars Comb. 43: (1996) |
9 | EE | Oleg V. Borodin:
Irreducible graphs in the Grünbaum-Havel 3-colour problem.
Discrete Mathematics 159(1-3): 247-249 (1996) |
1995 |
8 | EE | Oleg V. Borodin:
Triangles with restricted degree sum of their boundary vertices in plane graphs.
Discrete Mathematics 137(1-3): 45-51 (1995) |
1994 |
7 | EE | Oleg V. Borodin:
Simultaneous coloring of edges and faces of plane graphs.
Discrete Mathematics 128(1-3): 21-33 (1994) |
1993 |
6 | | Oleg V. Borodin:
Joint extension of two theorems of Kotzig on 3-polytopes.
Combinatorica 13(1): 121-125 (1993) |
1992 |
5 | EE | Oleg V. Borodin:
Cyclic coloring of plane graphs.
Discrete Mathematics 100(1-3): 281-289 (1992) |
4 | EE | Oleg V. Borodin:
Diagonal coloring of the vertices of triangulations.
Discrete Mathematics 102(1): 95-96 (1992) |
3 | EE | Oleg V. Borodin,
Jean Mayer:
Decomposition of K13 into a torus graph and a graph imbedded in the Klein bottle.
Discrete Mathematics 102(1): 97-98 (1992) |
1991 |
2 | | Oleg V. Borodin:
Four problems on plane graphs raised by Branko Grünbaum.
Graph Structure Theory 1991: 149-156 |
1977 |
1 | EE | Oleg V. Borodin,
Alexandr V. Kostochka:
On an upper bound of a graph's chromatic number, depending on the graph's degree and density.
J. Comb. Theory, Ser. B 23(2-3): 247-250 (1977) |