Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Oleg V. Borodin
2010 – today
- 2013
[j67]- [j66]Oleg V. Borodin, Anna O. Ivanova: Describing (d-2)-stars at d-vertices, d≤5, in normal plane maps. Discrete Mathematics 313(17): 1700-1709 (2013)
- [j65]Oleg V. Borodin, Anna O. Ivanova: Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5. Discrete Mathematics 313(17): 1710-1714 (2013)
- [j64]Oleg V. Borodin, Anna O. Ivanova: Acyclic 4-Choosability of Planar Graphs with No 4- and 5-Cycles. Journal of Graph Theory 72(4): 374-397 (2013)
- 2012
- [j63]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)
- [j62]Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud: (k, 1)-coloring of sparse graphs. Discrete Mathematics 312(6): 1128-1135 (2012)
- [j61]Oleg V. Borodin, Anna O. Ivanova: Acyclic 4-choosability of planar graphs without adjacent short cycles. Discrete Mathematics 312(22): 3335-3341 (2012)
- [j60]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)
- [j59]Oleg V. Borodin, Alexei N. Glebov, T. R. Jensen: A step towards the strong version of Havel's three color conjecture. J. Comb. Theory, Ser. B 102(6): 1295-1320 (2012)
- [i1]Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew Yancey: Short proofs of coloring theorems on planar graphs. CoRR abs/1211.3981 (2012)
- 2011
- [j58]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)
- [j57]Oleg V. Borodin, Anna O. Ivanova: List injective colorings of planar graphs. Discrete Mathematics 311(2-3): 154-165 (2011)
- [j56]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)
- [j55]Oleg V. Borodin, Anna O. Ivanova: List strong linear 2-arboricity of sparse graphs. Journal of Graph Theory 67(2): 83-90 (2011)
- [j54]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
- [j53]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)
- [j52]Oleg V. Borodin, Min 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)
- [j51]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)
- [j50]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)
- [j49]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)
2000 – 2009
- 2009
- [j48]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)
- [j47]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)
- [j46]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)
- [j45]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)
- [j44]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)
- [j43]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)
- [j42]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
- [j41]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
- [j40]Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, Jan van den Heuvel: A new upper bound on the cyclic chromatic number. Journal of Graph Theory 54(1): 58-72 (2007)
- 2006
- [j39]Oleg V. Borodin: On acyclic colorings of planar graphs. Discrete Mathematics 306(10-11): 953-972 (2006)
- 2005
- [j38]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)
- [j37]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
- [j36]
- [j35]Oleg V. Borodin, D. V. Loparev: Height of minor faces in plane normal maps. Discrete Applied Mathematics 135(1-3): 31-39 (2004)
- [j34]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
- [j33]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
- [j32]Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Eric Sopena: Acyclic list 7-coloring of planar graphs. Journal of Graph Theory 40(2): 83-90 (2002)
- [j31]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
- [j30]
- [j29]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)
- [j28]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
- [j27]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)
1990 – 1999
- 1999
- [j26]Oleg V. Borodin, Daniel P. Sanders, Yue Zhao: On cyclic colorings and their generalizations. Discrete Mathematics 203(1-3): 23-40 (1999)
- [j25]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)
- [j24]Oleg V. Borodin, Douglas R. Woodall: Cyclic Degrees of 3-Polytopes. Graphs and Combinatorics 15(3): 267-277 (1999)
- 1998
- [j23]Oleg V. Borodin: Triangulated 3-polytopes without faces of low weight. Discrete Mathematics 186(1-3): 281-285 (1998)
- [j22]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)
- [j21]Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall: On kernel-perfect orientations of line graphs. Discrete Mathematics 191(1-3): 45-49 (1998)
- [j20]Oleg V. Borodin, Douglas R. Woodall: Short cycles of low weight in normal plane maps with minimum degree 5. Discussiones Mathematicae Graph Theory 18(2): 159-164 (1998)
- [j19]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
- [j18]Oleg V. Borodin: A new proof of Grünbaum's 3 color theorem. Discrete Mathematics 169(1-3): 177-183 (1997)
- [j17]Oleg V. Borodin: Minimal vertex degree sum of a 3-path in plane maps. Discussiones Mathematicae Graph Theory 17(2): 279-284 (1997)
- [j16]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)
- [j15]Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall: Total colorings of planar graphs with large maximum degree. Journal of Graph Theory 26(1): 53-59 (1997)
- 1996
- [j14]Oleg V. Borodin: To the paper of H.L. Abbott and B. Zhou on 4-critical planar graphs. Ars Comb. 43 (1996)
- [j13]Oleg V. Borodin: Irreducible graphs in the Grünbaum-Havel 3-colour problem. Discrete Mathematics 159(1-3): 247-249 (1996)
- [j12]Oleg V. Borodin: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings. Journal of Graph Theory 21(2): 183-186 (1996)
- [j11]Oleg V. Borodin: Cyclic degree and cyclic coloring of 3-polytopes. Journal of Graph Theory 23(3): 225-231 (1996)
- [j10]Oleg V. Borodin: Structural theorem on plane graphs with application to the entire coloring number. Journal of Graph Theory 23(3): 233-239 (1996)
- 1995
- [j9]Oleg V. Borodin: Triangles with restricted degree sum of their boundary vertices in plane graphs. Discrete Mathematics 137(1-3): 45-51 (1995)
- [j8]
- 1994
- [j7]Oleg V. Borodin: Simultaneous coloring of edges and faces of plane graphs. Discrete Mathematics 128(1-3): 21-33 (1994)
- 1993
- [j6]Oleg V. Borodin: Joint extension of two theorems of Kotzig on 3-polytopes. Combinatorica 13(1): 121-125 (1993)
- 1992
- [j5]
- [j4]Oleg V. Borodin: Diagonal coloring of the vertices of triangulations. Discrete Mathematics 102(1): 95-96 (1992)
- [j3]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
- [c1]Oleg V. Borodin: Four problems on plane graphs raised by Branko Grünbaum. Graph Structure Theory 1991: 149-156
- 1990
- [j2]Oleg V. Borodin: Diagonal 11-coloring of plane triangulations. Journal of Graph Theory 14(6): 701-704 (1990)
1970 – 1979
- 1977
- [j1]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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-12 21:34 CEST by the dblp team