Oleg V. Borodin

	2012
53		Oleg V. Borodin, Anna O. Ivanova: List 2-facial 5-colorability of plane graphs with girth at least 12. Discrete Mathematics 312(2): 306-314 (2012)
52		Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud: (k, 1)-coloring of sparse graphs. Discrete Mathematics 312(6): 1128-1135 (2012)
51		Oleg V. Borodin, Anna O. Ivanova: 2-distance 4-colorability of planar subcubic graphs with girth at least 22. Discussiones Mathematicae Graph Theory 32(1): 141-151 (2012)
	2011
50		Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud: (k, j)-coloring of sparse graphs. Discrete Applied Mathematics 159(17): 1947-1953 (2011)
49		Oleg V. Borodin, Anna O. Ivanova: List injective colorings of planar graphs. Discrete Mathematics 311(2-3): 154-165 (2011)
48		Oleg V. Borodin, Alexei N. Glebov: Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable. Journal of Graph Theory 66(1): 1-31 (2011)
47		Oleg V. Borodin, Anna O. Ivanova: List strong linear 2-arboricity of sparse graphs. Journal of Graph Theory 67(2): 83-90 (2011)
46		Oleg V. Borodin, Anna O. Ivanova: Acyclic 5-choosability of planar graphs without adjacent short cycles. Journal of Graph Theory 68(2): 169-176 (2011)
	2010
45		Oleg V. Borodin, Mickaël Montassier, André Raspaud: Planar graphs without adjacent cycles of length at most seven are 3-colorable. Discrete Mathematics 310(1): 167-173 (2010)
44		Oleg V. Borodin, M. Chen, Anna O. Ivanova, André Raspaud: Acyclic 3-choosability of sparse graphs with girth at least 7. Discrete Mathematics 310(17-18): 2426-2434 (2010)
43		Oleg V. Borodin, Alexei N. Glebov, André Raspaud: Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. Discrete Mathematics 310(20): 2584-2594 (2010)
42		Oleg V. Borodin, Anna O. Ivanova, André Raspaud: Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles. Discrete Mathematics 310(21): 2946-2950 (2010)
41		Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, Pascal Ochem, André Raspaud: Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. Journal of Graph Theory 65(2): 83-93 (2010)
	2009
40		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)
39		Oleg V. Borodin, Anna O. Ivanova: 2-distance (Delta+2)-coloring of planar graphs with girth six and Delta>=18. Discrete Mathematics 309(23-24): 6496-6502 (2009)
38		Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka, Naeem N. Sheikh: Decompositions of quadrangle-free planar graphs. Discussiones Mathematicae Graph Theory 29(1): 87-99 (2009)
37		Oleg V. Borodin, Anna O. Ivanova: List 2-distance (Delta+2)-coloring of planar graphs with girth six. Eur. J. Comb. 30(5): 1257-1262 (2009)
36		Oleg V. Borodin, Alexei N. Glebov, Mickaël Montassier, André Raspaud: Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. J. Comb. Theory, Ser. B 99(4): 668-673 (2009)
35		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)
34		Oleg V. Borodin, Anna O. Ivanova: Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable. Journal of Graph Theory 62(3): 234-240 (2009)
	2008
33		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
32		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
31		Oleg V. Borodin: On acyclic colorings of planar graphs. Discrete Mathematics 306(10-11): 953-972 (2006)
	2005
30		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)
29		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
28		Oleg V. Borodin: Preface: Russian Translations II. Discrete Applied Mathematics 135(1-3): 1- (2004)
27		Oleg V. Borodin, D. V. Loparev: Height of minor faces in plane normal maps. Discrete Applied Mathematics 135(1-3): 31-39 (2004)
26		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
25		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
24		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
23		Oleg V. Borodin: Preface. Discrete Applied Mathematics 114(1-3): 1 (2001)
22		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)
21		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
20		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
19		Oleg V. Borodin, Daniel P. Sanders, Yue Zhao: On cyclic colorings and their generalizations. Discrete Mathematics 203(1-3): 23-40 (1999)
18		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)
17		Oleg V. Borodin, Douglas R. Woodall: Cyclic Degrees of 3-Polytopes. Graphs and Combinatorics 15(3): 267-277 (1999)
	1998
16		Oleg V. Borodin: Triangulated 3-polytopes without faces of low weight. Discrete Mathematics 186(1-3): 281-285 (1998)
15		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		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		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		Oleg V. Borodin: A new proof of Grünbaum's 3 color theorem. Discrete Mathematics 169(1-3): 177-183 (1997)
11		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		Oleg V. Borodin: Irreducible graphs in the Grünbaum-Havel 3-colour problem. Discrete Mathematics 159(1-3): 247-249 (1996)
	1995
8		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		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		Oleg V. Borodin: Cyclic coloring of plane graphs. Discrete Mathematics 100(1-3): 281-289 (1992)
4		Oleg V. Borodin: Diagonal coloring of the vertices of triangulations. Discrete Mathematics 102(1): 95-96 (1992)
3		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		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)

Coauthor Index

1	V. A. Aksionov	[29]
2	Hajo Broersma (H. J. Broersma)	[32]
3	M. Chen	[44]
4	Dmitry Fon-Der-Flaass	[21]
5	Alexei N. Glebov	[30] [32] [36] [43] [48]
6	J. van den Heuvel	[32]
7	Anna O. Ivanova	[34] [37] [38] [39] [40] [41] [42] [44] [46] [47] [49] [50] [51] [52] [53]
8	Seog-Jin Kim	[26]
9	Alexandr V. Kostochka	[1] [11] [13] [14] [15] [18] [20] [21] [22] [26] [33] [35] [38] [40]
10	D. V. Loparev	[27]
11	Jean Mayer	[3]
12	Leonid S. Melnikov	[29]
13	Mickaël Montassier	[36] [41] [45] [50] [52]
14	Jaroslav Nesetril (Jarik Nesetril)	[15] [18]
15	Pascal Ochem	[41]
16	André Raspaud	[15] [18] [21] [22] [25] [30] [36] [41] [42] [43] [44] [45] [50] [52]
17	Gert Sabidussi	[29]
18	Mohammad R. Salavatipour	[30]
19	Daniel P. Sanders	[19]
20	Naeem N. Sheikh	[33] [35] [38] [40]
21	Eric Sopena	[15] [18] [21] [22]
22	Michael Stiebitz	[29]
23	Bjarne Toft	[20] [29]
24	Douglas B. West	[26]
25	Douglas R. Woodall	[11] [13] [14] [17] [24]
26	Gexin Yu	[33] [35]
27	Yue Zhao	[19]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page