The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Oleg V. Borodin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  32. Planar graphs decomposable into a forest and a matching. [Citation Graph (, )][DBLP]


  33. 2-distance (Delta+2)-coloring of planar graphs with girth six and Delta>=18. [Citation Graph (, )][DBLP]


  34. Planar graphs without adjacent cycles of length at most seven are 3-colorable. [Citation Graph (, )][DBLP]


  35. Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. [Citation Graph (, )][DBLP]


  36. Acyclic 3-choosability of sparse graphs with girth at least 7. [Citation Graph (, )][DBLP]


  37. Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles. [Citation Graph (, )][DBLP]


  38. Decomposing a planar graph with girth 9 into a forest and a matching. [Citation Graph (, )][DBLP]


  39. List 2-distance (Delta+2)-coloring of planar graphs with girth six. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002